LeetCode - 283. Move Zeroes #Jav

2016-01-19  本文已影响0人  Sinexs

Question

把数组所有的值为0的元素移到末尾

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.

Solutions

写了个效率很低的

public class Solution {
    public void moveZeroes(int[] nums) {
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 0) {
                for (int j = i + 1; j < nums.length; j++) {
                    if (nums[j] != 0) {
                        nums[i] = nums[j];
                        nums[j] = 0;
                        break;
                    }
                }
            }
        }
    }
}

效率高的不会写,就去讨论区研究了下

public class Solution {
  public void moveZeroes(int[] nums) {
  int index = 0; 
    for(int i = 0;i<nums.length;i++){ 
      if(nums[i] !=0){ 
        nums[index++] = nums[i];
      }
    }
 
    for(int i = index;i<nums.length;i++){
        nums[i] = 0; 
    }
  }
}

好厉害,佩服佩服

上一篇 下一篇

猜你喜欢

热点阅读