数组简单编程题
将int转为String,调用.length,然后%2==0即为偶数
class Solution1295 {
public int findNumbers(int[] nums) {
int count =0;
for(int i=0;i<nums.length;i++){
if(String.valueOf(nums[i]).length()%2==0){
count++;
}
}
return count;
}
}
class Solution1266 {
public int minTimeToVisitAllPoints(int[][] points) {
int count = 0,dx=0,dy=0;
for (int i = 0;i<points.length-1;i++) {//循环控制条件
dx = Math.abs(points[i][0]-points[i+1][0]);//▲x
dy = Math.abs(points[i][1]-points[i+1][1]);//▲y
count = count+Math.max(dx,dy);//取最大值求和
}
return count;
}
}
class Solution1351 {
public int countNegatives(int[][] grid) {
int count=0;
for (int i=0;i<grid.length;i++){
if (grid[i][0]<0){
count+=(grid.length-i)*grid[0].length;
break;
}
for (int j=0;j<grid[0].length;j++){
if (grid[i][j]<0){
count+=(grid[0].length-j);
break;
}
}
}
return count;
}
}
class Solution1304 {
public int[] sumZero(int n) {
int [] res = new int[n];
for(int i=0;i<n/2;i++){
res[i * 2]=i+1;
res[i * 2 + 1]=-(i+1);
}
return res;
}
}