-
Notifications
You must be signed in to change notification settings - Fork 40
/
ValidPalindrome_II.js
49 lines (45 loc) · 1.16 KB
/
ValidPalindrome_II.js
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
48
49
// Source : https://leetcode.com/problems/valid-palindrome-ii
// Author : Dean Shi
// Date : 2017-09-21
/***************************************************************************************
*
* 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
*
***************************************************************************************/
/**
* @param {string} s
* @return {boolean}
*/
var validPalindrome = function(s) {
let left = 0, right = s.length - 1
while (left < right) {
if (s[left] !== s[right]) {
return removeCharAndCheck(s, left, right - 1)
|| removeCharAndCheck(s, left + 1, right)
}
++left
--right
}
return true
};
function removeCharAndCheck(s, left, right) {
while (left < right) {
if (s[left++] !== s[right--]) return false
}
return true
}