algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
src/main/java/com/thealgorithms/others/cn/HammingDistance.java
View File

@@ -5,12 +5,14 @@ import java.util.List;
public class HammingDistance {
public int getHammingDistanceBetweenBits(String senderBits, String receiverBits) {
if(senderBits.length() != receiverBits.length()) {
throw new IllegalArgumentException("Sender and Receiver bits should be same");
public int getHammingDistanceBetweenBits(
String senderBits,
String receiverBits
) {
if (senderBits.length() != receiverBits.length()) {
throw new IllegalArgumentException(
"Sender and Receiver bits should be same"
);
}
List<byte[]> byteArray = new ArrayList<>();
@@ -18,20 +20,19 @@ public class HammingDistance {
byteArray.add(senderBits.getBytes());
byteArray.add(receiverBits.getBytes());
byte[] senderData = byteArray.get(0);
byte[] receiverData = byteArray.get(1);
int totalErrorBitCount = 0;
for(int i = 0; i < senderData.length; i++){
totalErrorBitCount += senderData[i] ^ receiverData[i];
for (int i = 0; i < senderData.length; i++) {
totalErrorBitCount += senderData[i] ^ receiverData[i];
}
if(totalErrorBitCount == 0){
if (totalErrorBitCount == 0) {
System.out.println("No Error bit in data segments");
} else{
System.out.println("Total Error bit count "+totalErrorBitCount);
} else {
System.out.println("Total Error bit count " + totalErrorBitCount);
}
return totalErrorBitCount;
}