1、最大连续1的个数
public int findMaxConsecutiveOnes(int[] nums) {
int count=0;
int result=0;
for (int num : nums) {
if (num == 1) count++;
else count = 0;
result = Math.max(count, result);
}
return result;
}
2、移动零
public void moveZeroes(int[] nums) {
int l=0;
int r=0;
while(r<nums.length){
if (nums[r]!=0){
nums[l]=nums[r];
if (r!=l) nums[r]=0;
l++;
}
r++;
}
}