We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
if(n==0){// n + i = n ^ i// 0 + 0 = 0 ^ 0 -> only casereturn1;}// For any number this is true, so start at 1:// n + 0 = n ^ 0longcases=1;Stringbin=Long.toBinaryString(n);for(charc:bin.toCharArray()){if(c!='0'){continue;}cases*=2;}returncases;
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Sum vs XOR
You are viewing a single comment's thread. Return to all comments →
Java