LeetCode 136. Single Number

136. Single Number

题目：

Given an 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?

难度：Medium

总结：

练习使用map，基本思想还是位操作。对比vector新插入数据要先push_back才能用下标访问，map可以初始化map<int,int>data后，直接下标插入/访问数据。

效率非常低还需要改进！

Runtime:116ms

AC代码

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        std::map<int,int> data;
        std::map<int,int>::iterator it;
        int singleNumber=0;
        for(int i=0;i<nums.size();i++)//initial map
        {
            data[nums[i]]=0;
        }
        for(int i=0;i<nums.size();i++)
        {
            data[nums[i]]++;
           // cout<<data[nums[i]];
        }
        for(int i=0;i<nums.size();i++)
        {
            if(data[nums[i]]==1)//only appears once,then we find the singleNumber
            {
               // cout<<nums[i];
                singleNumber=nums[i];
                break;
            }
        }
        return singleNumber;
        
    }
};