Count number of 1's in Java
Page 1 of 1
Count number of 1's in Java
Best Way: O(m): m is number of 1
int numOnesInBinary(int number){
int numOnes=0;
while(number!=0){
number=number&(number-1);
numOnes++;
}
return numOnes;
}
Normal ways:
int numOnesInBinary(int number){
int numOnes=0;
while(number!=0){
if((number&1)==1)
numOnes++;
number=number>>>1;
}
return numOnes;
}
int numOnesInBinary(int number){
int numOnes=0;
while(number!=0){
number=number&(number-1);
numOnes++;
}
return numOnes;
}
Normal ways:
int numOnesInBinary(int number){
int numOnes=0;
while(number!=0){
if((number&1)==1)
numOnes++;
number=number>>>1;
}
return numOnes;
}
skyboard- Posts : 31
Join date : 2011-09-03
Similar topics
» Given a magic number sum, to find if there are two numbers whose sum equals to the number
» Count the one bits in an integer
» Java Collection
» What are the differences between C++ and Java?
» Why are there no global variables in Java?
» Count the one bits in an integer
» Java Collection
» What are the differences between C++ and Java?
» Why are there no global variables in Java?
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
|
|