refactor: remove useless parentheses

saahilmahato · saahilmahato · commit 85ff363df3eb · 2025-10-08T21:17:09.000+05:45
diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/DamerauLevenshteinDistance.java b/src/main/java/com/thealgorithms/dynamicprogramming/DamerauLevenshteinDistance.java
@@ -178,7 +178,7 @@ private static int computeMinimumCost(int[][] dp, int i, int j, int lastMatchRow
         int substitution = dp[i][j] + cost;
         int insertion = dp[i + 1][j] + 1;
         int deletion = dp[i][j + 1] + 1;
-        int transposition = dp[lastMatchRow][lastMatchCol] + (i - lastMatchRow - 1) + 1 + (j - lastMatchCol - 1);
+        int transposition = dp[lastMatchRow][lastMatchCol] + i - lastMatchRow - 1 + 1 + j - lastMatchCol - 1;
 
         return Math.min(Math.min(substitution, insertion), Math.min(deletion, transposition));
     }

Original file line number	Diff line number	Diff line change
`@@ -178,7 +178,7 @@ private static int computeMinimumCost(int[][] dp, int i, int j, int lastMatchRow`
`178`	`178`	`int substitution = dp[i][j] + cost;`
`179`	`179`	`int insertion = dp[i + 1][j] + 1;`
`180`	`180`	`int deletion = dp[i][j + 1] + 1;`
`181`		`- int transposition = dp[lastMatchRow][lastMatchCol] + (i - lastMatchRow - 1) + 1 + (j - lastMatchCol - 1);`
	`181`	`+ int transposition = dp[lastMatchRow][lastMatchCol] + i - lastMatchRow - 1 + 1 + j - lastMatchCol - 1;`
`182`	`182`
`183`	`183`	`return Math.min(Math.min(substitution, insertion), Math.min(deletion, transposition));`
`184`	`184`	`}`