z_zhaojun的博客

机会只会留给有准备的人

leetcode:283. Move Zeroes(Java)解答

转载请注明出处:z_zhaojun的博客
原文地址:http://blog.csdn.net/u012975705/article/details/50493772
题目地址:https://leetcode.com/problems/move-zeroes/
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.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [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.

解法(java):

public class Solution {
    public void moveZeroes(int[] nums) {
        if (nums != null) {
            int length = nums.length;
            for (int i = 0, j = 0; i < length; i++) {
                if (nums[i] != 0) {
                    if (i != j) {
                        nums[j] = nums[i];
                        nums[i] = 0;
                    }
                    j++;
                }
            }
        }
    }
}
阅读更多
版权声明:本文为博主原创文章,转载请注明出处。博客首页:http://blog.csdn.net/u012975705。订阅:http://blog.csdn.net/u012975705/rss/list https://blog.csdn.net/u012975705/article/details/50493772
个人分类: LeetCode 算法相关
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

leetcode:283. Move Zeroes(Java)解答

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭