Skip to content

zhangkaijian123 每日一题 MoveZeroes 修改注释 新增借鉴别人的方法 #11

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
May 29, 2019
Merged

zhangkaijian123 每日一题 MoveZeroes 修改注释 新增借鉴别人的方法 #11

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
15 changes: 14 additions & 1 deletion src/main/java/MoveZeroes/zhangkaijian123/MoveZeroes.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
* @author 张铠建
* @description
* 题目:给定一个数组num，编写一个函数将所有0移动到它的末尾，同时保持非零元素的相对顺序。
* 解题思路:记录第一个0的位置，与后边非零元素交换位置,cur为第一个0的下标
* 解题思路:记录第一个0的位置，与后边非零元素交换位置,cur为数组最左边的0的下标
* @createdate 2019-05-29 09:13
**/
public class MoveZeroes {
Expand All @@ -15,4 +15,17 @@ public void MoveZeros(int[] nums){
}
}
}
//先将非零的元素移到前边，再把剩下的元素置为0
public void MoveZeros1(int[] nums){
int temp=0;
for (int i =0;i<nums.length;i++){
if (nums[i]!=0){
nums[temp++]=nums[i];
}
}
for (int j = temp;j<nums.length;j++){
nums[temp]=0;
}
}

}