代码挑战：迁移0元素|C#
【摘要】 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.Example:Input: [0,1,0,3,12]Output: [1,3,12,0,0]Note:You must do ...
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.
Example:
Input: [0,1,0,3,12]
Output: [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.
方案：
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];
}
}
while(index < nums.Length)
{
nums[index++] = 0;
}
}
}
测试案例：
[TestMethod()]
public void Test1()
{
Solution solution = new Solution();
int[] nums = { 0, 1, 0, 3, 12 };
solution.moveZeroes(nums);
int[] expected = { 1, 3, 12, 0, 0 };
for (int i = 0; i < nums.Length; i++)
{
Assert.AreEqual(nums[i], expected[i]);
}
}
[TestMethod()]
public void Test2()
{
Solution solution = new Solution();
int[] nums = { 1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0, 9 };
solution.moveZeroes(nums);
int[] expected = { 1, 9, 8, 4, 2, 7, 6, 9, 0, 0, 0, 0 };
for (int i = 0; i < nums.Length; i++)
{
Assert.AreEqual(nums[i], expected[i]);
}
}
【版权声明】本文为华为云社区用户原创内容，转载时必须标注文章的来源（华为云社区）、文章链接、文章作者等基本信息， 否则作者和本社区有权追究责任。如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）