Skip to content

283. Move Zeros #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
codedrinker merged 2 commits into from
May 29, 2019
Merged

283. Move Zeros #5

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
c60837a
283. Move Zeros
May 29, 2019
0dcee37
二次修改MoveZeroes.java
May 29, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
41 changes: 41 additions & 0 deletions src/main/java/MoveZeroes/ZHANGJIKAI5/MoveZeroes.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
package com.its.leet.code.leetcode.MoveZeroes;


/**
* author：ZHANGJIKAI5
* 解题思路：遍历数组，判断到当前下标i的元素不为空时，代表需要与nums[j]交换位置，交换后，j++
* 此处本来想使用异或交换元素，从而少创建一个中间变量。
* 但两个相同值异或三重异或后会变成0，只能加一重判断，导致内存使用率没有降下来。
*/
public class MoveZeroes {


/**
* 执行用时 : 1 ms, 在Move Zeroes的Java提交中击败了97.69% 的用户
* 内存消耗 : 39.2 MB, 在Move Zeroes的Java提交中击败了86.28% 的用户
* @param nums
*/
public void moveZeroes(int[] nums) {
for (int i=0, j=0; i<nums.length; i++) {
if (nums[i] != 0) {
if (nums[i] != nums[j]) {
nums[i] = nums[i] ^ nums[j];
nums[j] = nums[i] ^ nums[j];
nums[i] = nums[i] ^ nums[j];
}
j++;
}
}
}

public static void main(String[] args) {
MoveZeroes moveZeroes = new MoveZeroes();
int[] input = { 2,1 };
moveZeroes.moveZeroes(input);
for (int i: input
) {
System.out.println(i);
}

}
}