publicintsearch(int[] nums,int target){int left =0;int right = nums.length-1;while(left<=right){int mid = left +(right - left)/2;if(nums[mid]>target){
right = mid -1;}elseif(nums[mid]< target){
left = mid +1;}else{return mid;}}return-1;}
publicintminSubArrayLen(int target,int[] nums){int left =0;int sum =0;int result =Integer.MAX_VALUE;for(int right =0; right < nums.length; right++){
sum += nums[right];while(sum >= target){
result =Math.min(result, right - left +1);
sum -= nums[left++];}}return result ==Integer.MAX_VALUE?0: result;}
59 螺旋矩阵【数组 | 循环】
publicint[][]generateMatrix(int n){//定义四个边界/**
* r,b两个边界不能设为n,因为输出大小为【n】【n】的数组其上限就是n-1;
*/int[][] result =newint[n][n];int l =0;int r = n -1;int t =0;int b = n -1;int num =1;while(num <= n * n){for(int i = l; i <= r; i++) result[t][i]= num++;
t++;for(int i = t; i <= b; i++) result[i][r]= num++;
r--;for(int i = r; i >= l; i--) result[b][i]= num++;
b--;for(int i = b; i >= t; i--) result[i][l]= num++;
l++;}return result;}