
TODO
Leave a commentJuly 6, 2017 by oneOokay
Longest Increasing Subsequence Count of Smaller Numbers After Self

Merge sort
Leave a commentJuly 3, 2017 by oneOokay
merge sort 是一个divide and conquer. 记不住什么是merge sort大概是因为merge sort的名字里面少了divide… merge sort:包含两部分,divide和merge. 时间复杂度是:O(nlogn) Divide: recursively divide elements into two parts: 所以这里要传入一个left和right index来标明目前要divide是原array中的哪一段 …
Continue reading 
Remove K Digits
Leave a commentJune 25, 2017 by oneOokay
Given a nonnegative integer num represented as a string, remove k digits from the number so that the new number …
Continue reading 
Find Mode in Binary Search Tree
Leave a commentJune 21, 2017 by oneOokay
Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given …
Continue reading 
Next Greater Element II
Leave a commentJune 21, 2017 by oneOokay
Given a circular array (the next element of the last element is the first element of the array), print the …
Continue reading 
01 Matrix
Leave a commentJune 20, 2017 by oneOokay
Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell. The distance …
Continue reading 
三个点的位置.Graham scan.Convex Hull
Leave a commentJune 18, 2017 by oneOokay
解决的是几何问题… 两条直线是否相交 二维数组标示x,y的点的集合, Find simple closed path. 就是点集外檐的一个轮廓.(connect the dots without crossing) 同样点的集合,求形成一个凸包的边缘点的集合. Orientation of 3 ordered points http://www.geeksforgeeks.org/orientation3orderedpoints/ 给3个点,判断这三个点的相对位置. …
Continue reading