[LeetCode] 자바, 283. Move Zeroes
283. 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: You must do this in-place without making a copy of the array. Minimize the total number of operations. 문제는 'int Array를 하나 주는데, 거기서 0을 모두 맨 뒤로 보내라' 입니다. 첫번째 시도는 class Solution { public void mo..
2020. 8. 9.
