#Hamming

leetcode 461. Hamming Distance

  classSolution{public:inthammingDistance(intx,inty){intres=x^y;intcount=0;intm;while(res){m=res&(res-1);count++;res=m;}returncount;}}; ...