LeetCode--Single Number II
2014-05-14 21:38
351 查看
Single Number II
Total Accepted: 14472 TotalSubmissions: 44420My Submissions
Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
class Solution { public: int singleNumber(int A[], int n) { sort(A,A+n); for(int i=0;i<n;i=i+3) { if(A[i]!=A[i+2]) return A[i]; } } };
相关文章推荐
- LeetCode (Single Number II)
- Leetcode Single Number II
- [LeetCode] [Single Number II 2013-10-02]
- [leetcode] Single Number II
- LeetCode----Single NumberII
- leetcode--Single Number II
- LeetCode Single Number I / II / III
- leetcode之Single Number II
- LeetCode - 137 - Single Number II
- Leetcode: single-number && single-number-ii
- [LeetCode] Single Number II 位运算
- ****(leetcode) Single Number II
- [LeetCode][Java] Single Number II
- 【Leetcode】Single Number II (Bit Manipulation)
- leetcode 137: Single Number II
- [C++]LeetCode: 67 Single Number II
- leetcode Single Number II
- 【leetcode】[137]Single Number II
- LeetCode 15 Single Number II
- LeetCode: Single Number II