Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,926 questions

51,859 answers

573 users

How to find hamming distance (number of bits in the same position that differs in two numbers) in Java

2 Answers

0 votes
class Program {
    private static int hamming_distance(int num1, int num2) {
    	int xr = num1 ^ num2;
    	int result = 0;
    
    	while (xr != 0) {
    		result += xr & 1;
    		xr = xr >> 1;
    	}
    
    	return result;
    }
    
    public static void main(String[] args) {
        int num1 =  9; // 1001
	    int num2 = 14; // 1110

	    System.out.print(hamming_distance(num1, num2));
    }
}



/*
run:

3

*/

 



answered Feb 5, 2024 by avibootz
0 votes
class Program {
    private static int hamming_distance(int num1, int num2) {
    	int xr = num1 ^ num2;
    	int result = 0;
    
    	while (xr != 0) {
    		xr = xr & (xr - 1);
    		result++;
    	}
    	
    	return result;
    }

    public static void main(String[] args) {
        int num1 =  9; // 1001
	    int num2 = 14; // 1110

	    System.out.print(hamming_distance(num1, num2));
    }
}



/*
run:

3

*/

 



answered Feb 5, 2024 by avibootz
...