algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-22 19:59:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add automatic linter (#4214)

Browse Source
This commit is contained in:
acbin
2023-06-09 20:05:14 +08:00
committed by GitHub
parent 00282efd8b
commit 415a04ea7f
188 changed files with 661 additions and 1133 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/main/java/com/thealgorithms/dynamicprogramming/PalindromicPartitioning.java
View File

@ -49,8 +49,7 @@ public class PalindromicPartitioning {
if (L == 2) {
isPalindrome[i][j] = (word.charAt(i) == word.charAt(j));
} else {
isPalindrome[i][j]
= (word.charAt(i) == word.charAt(j)) && isPalindrome[i + 1][j - 1];
isPalindrome[i][j] = (word.charAt(i) == word.charAt(j)) && isPalindrome[i + 1][j - 1];
}
}
}
@ -81,8 +80,7 @@ public class PalindromicPartitioning {
word = input.nextLine();
// ans stores the final minimal cut count needed for partitioning
int ans = minimalpartitions(word);
System.out.println(
"The minimum cuts needed to partition \"" + word + "\" into palindromes is " + ans);
System.out.println("The minimum cuts needed to partition \"" + word + "\" into palindromes is " + ans);
input.close();
}
}