LeetCode-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:
[0,1,0,3,12]
[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.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 | public void moveZeroes( int [] nums) { //my int flag = 0 ; for ( int i = 0 ; i < nums.length; i++) { if ( 0 !=nums[i]){ if (flag!=i){ nums[flag]=nums[i]; } flag++; } } for (;flag<nums.length;flag++){ nums[flag]= 0 ; } } |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步