![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
Jcldcdmf
haha
展开
-
31. 下一个排列
挖坑 class Solution { public void nextPermutation(int[] nums) { int i = nums.length - 1; for(;i > 0; i--){ if(nums[i] > nums[i - 1])break; } int pos = i; if(i > 0){ for(int j = i +原创 2020-10-20 23:47:22 · 79 阅读 · 0 评论 -
33. 搜索旋转排序数组
class Solution { public int search(int[] nums, int target) { int left = 0,right = nums.length - 1; int pos = -1; while(left < right){ int mid = (left + right) / 2; if(mid == left){ //此时right = left + 1原创 2020-10-20 23:40:12 · 69 阅读 · 0 评论