Single Number II
Total Accepted: 14472 Total Submissions: 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