a716121的专栏

class Solution { public int[] getLeastNumbers(int[] arr, int k) { Arrays.sort(arr); return Arrays.copyOfRange(arr,0,k); }}Arrays.copyOfRange()Arrays.copyOfRange(arr,fr...

class Solution { public int[] spiralOrder(int[][] matrix) { if(matrix.length==0) return new int[0]; int l=0,r=matrix[0].length-1,t=0,b=matrix.length-1,x=0; int []res=new...

解题思路：Java:public class Solution { public int RectCover(int target) { int a=1,b=2,sum=0; if(target<=2) return target; for(int i=3;i<=target;i++){ ...

假设当前位置是最左下角，坐标[i-1,0]。它是行最大，列最小的值。当满足行>=0，列<col时寻找：[i][j]<tar:j++;[i][j]>tar i--;java代码：public class Solution { public boolean Find(int target, int [][] array) { ...