LeetCode -- Single Number III

LeetCode -- Single Number III
Description:


Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.


For example:


Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].


In an array, only two numbers appear once, And the rest appear twice.


Ideas:
If the space permits, we recommend that you use a hash table directly.


Implementation Code:

Public class Solution {public int [] SingleNumber (int [] nums) {var hash = new Dictionary

 
  
(); For (var I = 0; I <nums. length; I ++) {if (hash. containsKey (nums [I]) {hash [nums [I] ++;} else {hash. add (nums [I], 1) ;}} var ret = new List

  
   
(); Foreach (var k in hash. keys) {if (hash [k] = 1) {ret. add (k);} if (ret. count = 2) {break;} return ret. toArray ();}}