[Leetcode Algorithm I, Day2] [leetcode 283, leetcode 167 ][c++]
한줄평 : 와 오늘문제는 짧지만 아주 뇌를 자극해준다. HINT! 더보기 two pointer 283. Move Zeroes Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array. 한줄해석 : 0을 뒤로 옮기되, 숫자 배열을 바꾸지마라. Example 1: Input: nums = [0,1,0,3,12] Output: [1,3,12,0,0] Example 2: Input: nums = [0] Output: [0] Co..