Skip to content

Add test #45

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 1 commit into from
Jun 11, 2019
Merged

Add test #45

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
30 changes: 30 additions & 0 deletions src/main/java/MoveZeroes/weichong0325/MoveZeroes.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
package MoveZeroes.weichong0325;
/**
* Create by weichong0325 on 2019/5/30
* 解题思路：
* 遍历数组，记录元素为0的个数为count。
* 当前元素不为0时，其下标减去count即为数组去掉位于该元素前所有0后应处的位置，最后在末尾按count补全0。
*/
public class MoveZeroes {
public static void moveZeroes(int[] nums) {
int count=0;
for (int i = 0; i < nums.length; i++) {
if(nums[i]==0){
count++;
} else{
nums[i-count]=nums[i];
}
}
for(int i=nums.length-count;i<nums.length;i++){
nums[i]=0;
}
}
public static void main(String[] args) {
int[] intList = new int[]{0,1,0,3,12};
moveZeroes(intList);
}
}
/*
执行用时 : 1 ms, 在Move Zeroes的Java提交中击败了97.64% 的用户
内存消耗 : 36.9 MB, 在Move Zeroes的Java提交中击败了96.14% 的用户
*/