[Easy] [leetcode面试] moveZeroes java方案, 使用main函数测试

原题目： https://leetcode.com/problems/move-zeroes/

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.

Example:

Input: [0,1,0,3,12]
Output: [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.

记录一个评论中java的解决方案:

class moveZeroes
{
  
    public static void main(String[] args)
    {
        
        String str = "321023021";

        char[] arrayV = str.toCharArray();

        if (arrayV == null || arrayV.length == 0) return;        

        int insertPos = 0;
        for (char charV: arrayV) {
            if (charV != '0') arrayV[insertPos++] = charV;
        }        
    
        while (insertPos < arrayV.length) {
            arrayV[insertPos++] = '0';
        }
        
        System.out.println(arrayV);
    }
}