首页 > 代码库 > Single Number II <LeetCode>
Single Number II <LeetCode>
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?
1 class Solution { 2 public: 3 int singleNumber(int A[], int n) { 4 if(n==1) return A[0]; 5 sort(A,A+n); 6 int i=0; 7 while(A[i]==A[i+2]&&1!=n-1) 8 { 9 i=i+3;10 }11 return A[i];12 }13 };
Single Number II <LeetCode>
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。