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

Appearance settings

Latest commit

 

History

History
History
47 lines (42 loc) · 1.24 KB

File metadata and controls

47 lines (42 loc) · 1.24 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
package string;
/**
* Created by gouthamvidyapradhan on 09/12/2017.
* Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.
Example 1:
Input: "aba"
Output: True
Example 2:
Input: "abca"
Output: True
Explanation: You could delete the character 'c'.
Note:
The string will only contain lowercase characters a-z. The maximum length of the string is 50000.
*/
public class ValidPalindromeII {
/**
* Main method
* @param args
* @throws Exception
*/
public static void main(String[] args) throws Exception{
System.out.println(new ValidPalindromeII().validPalindrome("aaaaaab"));
}
public boolean validPalindrome(String s) {
for(int i = 0, j = s.length() - 1; i < j;){
if(s.charAt(i) == s.charAt(j)){
i++; j--;
} else {
return isPaliandrome(s.substring(i, j)) || isPaliandrome(s.substring(i + 1, j + 1));
}
}
return true;
}
private boolean isPaliandrome(String s){
for(int i = 0, j = s.length() - 1; i < j;){
if(s.charAt(i) == s.charAt(j)){
i++; j--;
} else return false;
}
return true;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.