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