代码挑战：找到单一数字-C#
【摘要】 Given a non-empty array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi...
Given a non-empty array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
Example 1:
Input: [2,2,1]
Output: 1
Example 2:
Input: [4,1,2,1,2]
Output: 4方案1：
public class Solution
{
public int SingleNumber(int[] nums)
{
int result = nums[0];
for(int i = 1; i < nums.Length; i ++)
{
result ^= nums[i];
}
return result;
}
}
方案2：
public class Solution
{
public int SingleNumber(int[] nums)
{
HashSet<int> hs = new HashSet<int>();
for (int i = 0; i < nums.Length; i++)
{
if(hs.Contains(nums[i]))
{
hs.Remove(nums[i]);
}
else
{
hs.Add(nums[i]);
}
}
return hs.First();
}
}
测试案例：
[TestMethod()]
public void Test1()
{
Solution solution = new Solution();
int[] nums = { 2, 2, 1 };
Assert.AreEqual(1, solution.SingleNumber(nums));
}
[TestMethod()]
public void Test2()
{
Solution solution = new Solution();
int[] nums = { 4, 1, 2, 1, 2 };
Assert.AreEqual(4, solution.SingleNumber(nums));
}
【版权声明】本文为华为云社区用户原创内容，转载时必须标注文章的来源（华为云社区）、文章链接、文章作者等基本信息， 否则作者和本社区有权追究责任。如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）