摘要：
Binary search.class Solution { int _findClosest(vector &A, int v) { int s = 0, e = A.size() - 1; int ret = INT_MAX; while(s... 阅读全文
posted @ 2015-10-02 13:02
Tonix
阅读(275)
评论(0)
推荐(0)
摘要：
Flip over your mind: in rotated subarray case, we can simply cut the continuous smallest subarray.class Solution {public: /** * @param A an int... 阅读全文
posted @ 2015-10-02 00:19
Tonix
阅读(156)
评论(0)
推荐(0)
浙公网安备 33010602011771号