經(jīng)過之前《認真配眼鏡（一）之驗光篇》和《認真配眼鏡（二）之鏡架選購篇》這兩篇文章的介紹，拿到靠譜的驗光數(shù)據(jù)和合適的眼鏡架后，最后一步就是進行鏡片加工，得到最終的近視眼鏡。 鏡...
IP屬地：湖南
-
認真配眼鏡（三）之鏡片加工篇
-
博主你好，從數(shù)組建堆的復雜度應該是O(N)？參考Robert Sedgewick的《Algorithm》第四版
手把手教你寫個大頂堆
今天我們來實現(xiàn)一個大頂堆，所謂大頂堆，即根節(jié)點的值大于等于其孩子節(jié)點的值。廢話少絮，直接開始。 堆是一個完全二叉樹，很適合用順序結(jié)構來實現(xiàn)，這里我們選擇數(shù)組。用數(shù)組實現(xiàn)堆時，...
-
Windows下VSCode+LaTex中文環(huán)境配置前言 前一段時間因為某門課的實驗報告（代碼+英文）強制要求使用LaTex寫，所以開始初步接觸了LaTex，使用的工具是TexLive 2017 + VSCode（配合LaTe...
-
Python3 PyQt5 pycharm 環(huán)境搭建簡書的 markdown 沒有目錄，截圖一張，讓大家看的清楚，找到自己需要的東西。 更新日志：2017年12月3日 增加 windows 配置 開發(fā)環(huán)境： MAC OS 10...
-
Qt 5.9.1 + Visual Studio 2017 環(huán)境配置前言 剛剛開始學習Qt，于是就從官網(wǎng)下載了最新版的Qt 5.9.1，對初學者而言應該首先掌握Qt的官方IDE——Qt Creator，但是非常神奇的是在我的兩臺電腦上，一模一...
-
Algorithm(S. Dasgupta) 習題8.22 題解
Problem In task scheduling, it is common to use a graph representation with a node for ...
-
LeetCode #357: Count Numbers with Unique Digits
Problem Given a non-negative integer n, count all numbers with unique digits, x, where ...
-
LeetCode #526: Beautiful Arrangement
Problem Suppose you have N integers from 1 to N. We define a beautiful arrangement as a...
-
LeetCode #401: Binary WatchProblem A binary watch has 4 LEDs on the top which represent the hours (0-11), and the ...
-
LeetCode #210: Course Schedule II
Problem There are a total of n courses you have to take, labeled from 0 to n - 1.Some c...
-
LeetCode#207: Course Schedule
Problem There are a total of n courses you have to take, labeled from 0 to n - 1.Some c...
-
LeetCode #72: Edit DistanceProblem Given two words word1 and word2, find the minimum number of steps required to c...
-
LeetCode #200: Number of Islands
Problem Given a 2d grid map of '1's (land) and '0's (water), count the number of island...
-
LeetCode #413: Arithmetic Slices
Problem A sequence of number is called arithmetic if it consists of at least three elem...
-
LeetCode #121: Best Time to Buy and Sell Stock
Problem Say you have an array for which the ith element is the price of a given stock o...
-
LeetCode #198: House Robber
Problem You are a professional robber planning to rob houses along a street. Each house...
-
LeetCode #303: Range Sum Query - Immutable
Problem Given an integer array nums, find the sum of the elements between indices i and...
-
LeetCode #338: Counting Bits
Problem Given a non negative integer number num. For every numbers i in the range 0 ≤ i...
-
LeetCode #122: Best Time to Buy and Sell Stock II
Problem Say you have an array for which the ith element is the price of a given stock o...