Solution: 此题是search inrotateed array 的变形， 多了 duplicate 的情况, 思路相同，但是必须加入d...

Solution: In a sorted rotated array, half of the elements must be in a s...

Solution1: Dynamic transfer function : dp(cur) = nums[i] + ( dp(prev) > ...

Tag: array, level : easy Solution: maintain two pointers, one iterate th...

Tag: array, level: easy Solution: Using two pointers, use first pointer ...

3 sum 的变形题 Solution1: sort first, then iterate the array, fix one elemen...

solution 1: sort the array, then fix two,using two pointers, one at the ...

Solution: Sort then using two pointers, one at the beginning element, on...