2017年2月15日
leetcode 34 Search for a Range
摘要： class Solution { public: vector<int> searchRange(vector<int>& nums, int target) { int idx = search(nums, 0, nums.size() - 1, target); if (idx == -1) r 阅读全文
posted @ 2017-02-15 23:00 王坤1993 阅读(147) 评论(0) 推荐(0)
leetcode 33 Search in Rotated Sorted Array
摘要： public class Solution { public int search(int[] A, int target) { int l = 0; int r = A.length - 1; while (l <= r) { int mid = (l + r) / 2; if (target = 阅读全文
posted @ 2017-02-15 00:01 王坤1993 阅读(145) 评论(0) 推荐(0)