面试笔试杂项积累-leetcode 281-285

283.283-Move Zeroes-Difficulty: Easy

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Note:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.

思路

把数组中的0挪到后面

用一个数标记当前该覆盖的位置，然后直接往前挪，最后把该位置之后的所有数赋值为0

public class Solution {
    public void MoveZeroes(int[] nums) {
                int cur = 0;
        for (int i = 0; i < nums.Length; i++)
        { 
            if(nums[i] != 0)
            {
                if (cur < i)
                    nums[cur] = nums[i];
                    ++cur;
            }
        }
        for (int i = cur; i < nums.Length; i++)
            nums[i] = 0;
    }
}