首页 > 其他 > 详细

283. Move Zeroes

时间:2020-07-25 10:07:33      阅读:54      评论:0      收藏:0      [点我收藏+]
package LeetCode_283

/**
 * 283. Move Zeroes
 * https://leetcode.com/problems/move-zeroes/description/
 *
 * 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.
 * */
class Solution {
    fun moveZeroes(nums: IntArray): Unit {
        var index = 0
        for (i in nums.indices) {
            if (nums[i] != 0) {
                nums[index++] = nums[i]
            }
        }
        for (i in index until nums.size) {
            nums[i] = 0
        }
    }
}

 

283. Move Zeroes

原文:https://www.cnblogs.com/johnnyzhao/p/13375084.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!