2019獨角獸企業重金招聘Python工程師標準>>>

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?

Subscribe?to see which companies asked this question

class?Solution?{ public:int?singleNumber(vector<int>&?nums)?{int?len=nums.size();int?res?=?0;for(int?i=0;?i<len;?i++){res?=?res^nums[i];}return?res;} };

轉載于:https://my.oschina.net/u/2368952/blog/527541

總結

以上是生活随笔為你收集整理的leetcode- Single Number的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。