binarySearch
Description二分查找，是arrays里常考的习题。对于同一题型，有几种写法，有的是start < end，有的是start + 1 < end。判断和中间值大小比较之后，有的是start = mid，有的是start = mid + 1等。并没有一个同一的解法，这里先给出一个统
...
【Leetcode】 118. Pascal's Triangle
DescriptionGiven numRows, generate the first numRows of Pascal’s triangle.
For example, given numRows = 5,Return
[ [1], [1,1], [1,2,1], [1,3,3,1],
...
LogisticRegression
Machine Learning谈到机器学习算法，从理解上来说，就是从已经有的数据首先要谈到监督学习和非监督学习。
监督学习，定义是利用一组已知类别的样本调整分类器参数，使其达到所要求性能的过程。这个理解很简单，就是我们通过算法面试，需要做一些算法题，如果有答案，我们就知道自己做的对不对，这样自
...
【Leetcode】120. Triangle
DescriptionGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, g
...
【Leetcode】Best Time to Buy and Sell Stock III
DescriptionSay you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You
...
【Leetcode】122. Best Time to Buy and Sell Stock II
DescriptionSay you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You
...
【Leetcode】121. Best Time to Buy and Sell Stock
DescriptionSay you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one
...
【Leetcode】128. Longest Consecutive Sequence
DescriptionGiven an unsorted array of integers, find the length of the longest consecutive elements sequence.
For example,Given [100, 4, 200, 1, 3, 2]
...
【Leetcode】152. Maximum Product Subarray
DescriptionFind the contiguous subarray within an array (containing at least one number) which has the largest product.
For example, given the array [
...
【Leetcode】154. Find Minimum in Rotated Sorted Array II
DescriptionSuppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0
...