原题链接:https://leetcode-cn.com/problems/single-number-ii/
这道题一个套路,就连 代码都大同小异,简单改造即可。
public class Solution {
public int SingleNumber(int[] nums) {
var dic = new Dictionary<int, int>();
for (int i = 0; i < nums.Length; i++)
{
if (dic.ContainsKey(nums[i]))
{
dic[nums[i]]++;
}
else
{
dic[nums[i]] = 1;
}
}
foreach (var item in dic)
{
if (item.Value==1)
{
return item.Key;
}
}
return -1;
}
}