mlxfora的博客

1266 我的更简洁 差不了很多 public int minTimeToVisitAllPoints(int[][] points) { int count=0; for(int i=1;i<points.length;i++) { int x=Math.abs(points[i][0]-points[i-1][0]); ...

760 不用去重 又开始暴力刷题了, public int[] anagramMappings(int[] A, int[] B) { int length=A.length; int[] out=new int[length]; for(int i=0;i<length;i++) { for(int j=0;j<length;j++) { i...

1342int count =0;public int numberOfSteps (int num) { if(num==0) { return count; } if(num%2==0) { num=num/2; }else { num--; } count++; ...

1365本人思路 public int[] smallerNumbersThanCurrent(int[] nums) { int length=nums.length; int out[]=new int[length]; for(int i=0;i<length;i++){ for(int j=0;j&...