Leetcode -- Single Number II

标签：

public class Solution {
    public int SingleNumber(int[] nums) 
    {
        var hash = new Dictionary<int , int>();
        for(var i = 0;i < nums.Length; i++){
            if(!hash.ContainsKey(nums[i])){
                hash.Add(nums[i],1);
            }
            else{
                hash[nums[i]]++;
            }
        }
        
        foreach(var k in hash.Keys){
            if(hash[k] != 3){
                return k;
            }
        }
        
        return 0;
    }
}

Leetcode -- Single Number II

标签：

原文地址：http://blog.csdn.net/lan_liang/article/details/49770815