Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: update solutions to lc problem: No.0680 #4016

Merged
merged 1 commit into from
Feb 3, 2025
Merged

feat: update solutions to lc problem: No.0680 #4016

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
61 changes: 31 additions & 30 deletions solution/0600-0699/0680.Valid Palindrome II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -94,18 +94,21 @@ class Solution:

```java
class Solution {
public boolean validPalindrome(String s) {
for (int i = 0, j = s.length() - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
return check(s, i + 1, j) || check(s, i, j - 1);
private char[] s;

public boolean validPalindrome(String S) {
this.s = S.toCharArray();
for (int i = 0, j = s.length - 1; i < j; ++i, --j) {
if (s[i] != s[j]) {
return check(i + 1, j) || check(i, j - 1);
}
}
return true;
}

private boolean check(String s, int i, int j) {
private boolean check(int i, int j) {
for (; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
if (s[i] != s[j]) {
return false;
}
}
Expand All @@ -120,18 +123,17 @@ class Solution {
class Solution {
public:
bool validPalindrome(string s) {
for (int i = 0, j = s.size() - 1; i < j; ++i, --j) {
if (s[i] != s[j]) {
return check(s, i + 1, j) || check(s, i, j - 1);
auto check = [&](int i, int j) {
for (; i < j; ++i, --j) {
if (s[i] != s[j]) {
return false;
}
}
}
return 1;
}

bool check(string s, int i, int j) {
for (; i < j; ++i, --j) {
return true;
};
for (int i = 0, j = s.size() - 1; i < j; ++i, --j) {
if (s[i] != s[j]) {
return false;
return check(i + 1, j) || check(i, j - 1);
}
}
return true;
Expand Down Expand Up @@ -164,18 +166,17 @@ func validPalindrome(s string) bool {

```ts
function validPalindrome(s: string): boolean {
for (let i: number = 0, j = s.length - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
return isPalinddrome(s.slice(i, j)) || isPalinddrome(s.slice(i + 1, j + 1));
const check = (i: number, j: number): boolean => {
for (; i < j; ++i, --j) {
if (s[i] !== s[j]) {
return false;
}
}
}
return true;
}

function isPalinddrome(s: string): boolean {
for (let i: number = 0, j = s.length - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
return false;
return true;
};
for (let i = 0, j = s.length - 1; i < j; ++i, --j) {
if (s[i] !== s[j]) {
return check(i + 1, j) || check(i, j - 1);
}
}
return true;
Expand All @@ -190,16 +191,16 @@ function isPalinddrome(s: string): boolean {
* @return {boolean}
*/
var validPalindrome = function (s) {
let check = function (i, j) {
const check = function (i, j) {
for (; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
if (s[i] !== s[j]) {
return false;
}
}
return true;
};
for (let i = 0, j = s.length - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
if (s[i] !== s[j]) {
return check(i + 1, j) || check(i, j - 1);
}
}
Expand Down
61 changes: 31 additions & 30 deletions solution/0600-0699/0680.Valid Palindrome II/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -91,18 +91,21 @@ class Solution:

```java
class Solution {
public boolean validPalindrome(String s) {
for (int i = 0, j = s.length() - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
return check(s, i + 1, j) || check(s, i, j - 1);
private char[] s;

public boolean validPalindrome(String S) {
this.s = S.toCharArray();
for (int i = 0, j = s.length - 1; i < j; ++i, --j) {
if (s[i] != s[j]) {
return check(i + 1, j) || check(i, j - 1);
}
}
return true;
}

private boolean check(String s, int i, int j) {
private boolean check(int i, int j) {
for (; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
if (s[i] != s[j]) {
return false;
}
}
Expand All @@ -117,18 +120,17 @@ class Solution {
class Solution {
public:
bool validPalindrome(string s) {
for (int i = 0, j = s.size() - 1; i < j; ++i, --j) {
if (s[i] != s[j]) {
return check(s, i + 1, j) || check(s, i, j - 1);
auto check = [&](int i, int j) {
for (; i < j; ++i, --j) {
if (s[i] != s[j]) {
return false;
}
}
}
return 1;
}

bool check(string s, int i, int j) {
for (; i < j; ++i, --j) {
return true;
};
for (int i = 0, j = s.size() - 1; i < j; ++i, --j) {
if (s[i] != s[j]) {
return false;
return check(i + 1, j) || check(i, j - 1);
}
}
return true;
Expand Down Expand Up @@ -161,18 +163,17 @@ func validPalindrome(s string) bool {

```ts
function validPalindrome(s: string): boolean {
for (let i: number = 0, j = s.length - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
return isPalinddrome(s.slice(i, j)) || isPalinddrome(s.slice(i + 1, j + 1));
const check = (i: number, j: number): boolean => {
for (; i < j; ++i, --j) {
if (s[i] !== s[j]) {
return false;
}
}
}
return true;
}

function isPalinddrome(s: string): boolean {
for (let i: number = 0, j = s.length - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
return false;
return true;
};
for (let i = 0, j = s.length - 1; i < j; ++i, --j) {
if (s[i] !== s[j]) {
return check(i + 1, j) || check(i, j - 1);
}
}
return true;
Expand All @@ -187,16 +188,16 @@ function isPalinddrome(s: string): boolean {
* @return {boolean}
*/
var validPalindrome = function (s) {
let check = function (i, j) {
const check = function (i, j) {
for (; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
if (s[i] !== s[j]) {
return false;
}
}
return true;
};
for (let i = 0, j = s.length - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
if (s[i] !== s[j]) {
return check(i + 1, j) || check(i, j - 1);
}
}
Expand Down
21 changes: 10 additions & 11 deletions solution/0600-0699/0680.Valid Palindrome II/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,20 +1,19 @@
class Solution {
public:
bool validPalindrome(string s) {
for (int i = 0, j = s.size() - 1; i < j; ++i, --j) {
if (s[i] != s[j]) {
return check(s, i + 1, j) || check(s, i, j - 1);
auto check = [&](int i, int j) {
for (; i < j; ++i, --j) {
if (s[i] != s[j]) {
return false;
}
}
}
return 1;
}

bool check(string s, int i, int j) {
for (; i < j; ++i, --j) {
return true;
};
for (int i = 0, j = s.size() - 1; i < j; ++i, --j) {
if (s[i] != s[j]) {
return false;
return check(i + 1, j) || check(i, j - 1);
}
}
return true;
}
};
};
17 changes: 10 additions & 7 deletions solution/0600-0699/0680.Valid Palindrome II/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,19 +1,22 @@
class Solution {
public boolean validPalindrome(String s) {
for (int i = 0, j = s.length() - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
return check(s, i + 1, j) || check(s, i, j - 1);
private char[] s;

public boolean validPalindrome(String S) {
this.s = S.toCharArray();
for (int i = 0, j = s.length - 1; i < j; ++i, --j) {
if (s[i] != s[j]) {
return check(i + 1, j) || check(i, j - 1);
}
}
return true;
}

private boolean check(String s, int i, int j) {
private boolean check(int i, int j) {
for (; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
if (s[i] != s[j]) {
return false;
}
}
return true;
}
}
}
6 changes: 3 additions & 3 deletions solution/0600-0699/0680.Valid Palindrome II/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,16 +3,16 @@
* @return {boolean}
*/
var validPalindrome = function (s) {
let check = function (i, j) {
const check = function (i, j) {
for (; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
if (s[i] !== s[j]) {
return false;
}
}
return true;
};
for (let i = 0, j = s.length - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
if (s[i] !== s[j]) {
return check(i + 1, j) || check(i, j - 1);
}
}
Expand Down
21 changes: 10 additions & 11 deletions solution/0600-0699/0680.Valid Palindrome II/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,16 +1,15 @@
function validPalindrome(s: string): boolean {
for (let i: number = 0, j = s.length - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
return isPalinddrome(s.slice(i, j)) || isPalinddrome(s.slice(i + 1, j + 1));
const check = (i: number, j: number): boolean => {
for (; i < j; ++i, --j) {
if (s[i] !== s[j]) {
return false;
}
}
}
return true;
}

function isPalinddrome(s: string): boolean {
for (let i: number = 0, j = s.length - 1; i < j; ++i, --j) {
if (s.charAt(i) != s.charAt(j)) {
return false;
return true;
};
for (let i = 0, j = s.length - 1; i < j; ++i, --j) {
if (s[i] !== s[j]) {
return check(i + 1, j) || check(i, j - 1);
}
}
return true;
Expand Down