tag:blogger.com,1999:blog-8522573717713847738.post1608013991014123809..comments2024-03-19T00:17:24.138-07:00Comments on Yu's Coding Garden : leetcode Question: Single Number IIAnonymoushttp://www.blogger.com/profile/00263085222060621782noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-8522573717713847738.post-33423703889298122412019-05-01T14:39:51.196-07:002019-05-01T14:39:51.196-07:00public int singleNumber(final List A) {
in...public int singleNumber(final List A) {<br /> int first = 0;<br /> int second = 0;<br /> int n = A.size();<br /> for (int a : A) {<br /> first = (first ^ a) & ~second;<br /> second = (second ^ a) & ~first;<br /> }<br /> return first;<br /> }Unknownhttps://www.blogger.com/profile/16975567312962364510noreply@blogger.comtag:blogger.com,1999:blog-8522573717713847738.post-86438937635790608772016-02-05T14:30:00.336-08:002016-02-05T14:30:00.336-08:00Wanna briefly explain traceformula's code:
p ...Wanna briefly explain traceformula's code: <br />p is the bits that appear twice<br />q is the bits that appear once or twiceTe Zhanghttps://www.blogger.com/profile/02145397447257117589noreply@blogger.comtag:blogger.com,1999:blog-8522573717713847738.post-54468461544407246642015-08-31T10:54:26.018-07:002015-08-31T10:54:26.018-07:00Here is another solution:
public class Solution { ...Here is another solution:<br />public class Solution { <br /> public int singleNumber(int[] nums) { <br /> int p = 0; <br /> int q = 0; <br /> for(int i = 0; i<nums.length; i++){ <br /> p = q & (p ^ nums[i]); <br /> q = p | (q ^ nums[i]); <br /> } <br /> return q; <br /> } <br />} <br /><br />Analysis from http://traceformula.blogspot.com/2015/08/single-number-ii-how-to-come-up-with.htmltraceformulahttps://www.blogger.com/profile/07593856187162437549noreply@blogger.com