33. 搜索旋转排序数组【中等】
https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (nums[mid] == target) {
return mid;
}
if (nums[mid] >= nums[left]) {
if (target >= nums[left] && target < nums[mid]) {
right = mid - 1;
}
else if (target < nums[left] || target > nums[mid]) {
left = mid + 1;
}
}
else if (nums[mid] < nums[left]) {
if (target >= nums[mid] && target <= nums[right]) {
left = mid + 1;
}
else if (target < nums[mid] || target > nums[right]) {
right = mid - 1;
}
}
}
return -1;
}
}
剑指 Offer 43. 1~n 整数中 1 出现的次数【困难】
https://leetcode-cn.com/problems/1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof/
236. 二叉树的最近公共祖先【中等】
https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/