Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit8fc0f4a

Browse files
authored
Merge pull requestneetcode-gh#89 from KHemanthRaju/main
Added 131. Palindrome Partitioning Java Solution
2 parentsa2d88f7 +5f75a7c commit8fc0f4a

File tree

2 files changed

+37
-0
lines changed

2 files changed

+37
-0
lines changed
Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
publicclassSolution {
2+
publicList<List<String>>partition(Strings) {
3+
List<List<String>>res =newArrayList<List<String>>();
4+
if (s.equals("")) {
5+
res.add(newArrayList<String>());
6+
returnres;
7+
}
8+
for (inti =0;i <s.length();i++) {
9+
if (isPalindrome(s,i +1)) {
10+
for (List<String>list :partition(s.substring(i+1))) {
11+
list.add(0,s.substring(0,i +1));
12+
res.add(list);
13+
}
14+
}
15+
}
16+
returnres;
17+
}
18+
19+
publicbooleanisPalindrome(Strings,intn) {
20+
for (inti =0;i <n /2;i++) {
21+
if (s.charAt(i) !=s.charAt(n -i -1))
22+
returnfalse;
23+
}
24+
returntrue;
25+
}
26+
}
Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
classSolution {
2+
publicintfindDuplicate(int[]nums) {
3+
Arrays.sort(nums);
4+
for(inti=1;i<nums.length;i++){
5+
if(nums[i] ==nums[i-1]){
6+
returnnums[i];
7+
}
8+
}
9+
return -1;
10+
}
11+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp