Array 8 - Shift Zero

Question website: https://leetcode.cn/leetbook/read/top-interview-questions-easy/x2ba4i/

public class Solution {
    public void MoveZeroes(int[] nums) {
        int k=0;
        for(int i=0;i<nums.Length-k;i++){
            if(nums[i]==0){
                k++;
                for(int j=i;j<nums.Length;j++){
                    if(j+1<nums.Length){
                        nums[j]=nums[j+1];
                    }
                }
                nums[nums.Length-k]=0;
                i--;
            }
        }
    }
}

Guess you like

Origin blog.csdn.net/oyqho/article/details/129599882