class Solution {
//using xor bit manipulation
public:
int singleNumber(int A[], int n) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int res = 0;
for(int i = 0; i < n; ++i)
res ^= A[i];
return res;
}
};
single number i
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章
leetcode-112-路徑總和
叄贰壹
2020-07-08 12:04:52
leetcode:實現 Trie (前綴樹)
zhangxiaojiakele
2020-07-08 11:07:35
學算法要讀《算法導論》嗎?
原創
2024-03-28 00:34:50
leetcode:石子游戲
zhangxiaojiakele
2020-07-08 11:07:39
leetcode:按摩師
zhangxiaojiakele
2020-07-08 11:07:39
leetcode:詞典中最長的單詞
zhangxiaojiakele
2020-07-08 11:07:39
leetcode:石子游戲II
zhangxiaojiakele
2020-07-08 11:07:39
leetcode:等差數列劃分
zhangxiaojiakele
2020-07-08 11:07:38
leetcode: 連續子數組的最大和
zhangxiaojiakele
2020-07-08 11:07:38
leetcode:二進制中1的個數
zhangxiaojiakele
2020-07-08 11:07:36
leetcode: 最低票價
zhangxiaojiakele
2020-07-08 11:07:35
leetcode:剪繩子
zhangxiaojiakele
2020-07-08 11:07:34
leetcode:最小的k個數
zhangxiaojiakele
2020-07-08 11:07:32
leetcode:距離原點最近的K個點
zhangxiaojiakele
2020-07-08 11:07:32