leetcode
yrHackson
这个作者很懒,什么都没留下…
展开
-
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 usi原创 2013-10-03 23:46:02 · 301 阅读 · 0 评论 -
single number
class Solution { 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 { re原创 2013-10-04 15:26:29 · 292 阅读 · 0 评论