algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

0131.分割回文串：Swift实现优化迭代中跳过逻辑

Browse Source
This commit is contained in:
bqlin
2021-12-18 20:23:12 +08:00
parent 622b443bbe
commit 690897f33f
1 changed files with 3 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
problems/0131.分割回文串.md
View File

@ -575,12 +575,9 @@ func partition(_ s: String) -> [[String]] {
for i in startIndex ..< s.count { for i in startIndex ..< s.count {
// 回文则收集，否则跳过 // 回文则收集，否则跳过
if isPalindrome(start: startIndex, end: i) { guard isPalindrome(start: startIndex, end: i) else { continue }
let substring = String(s[startIndex ... i]) let substring = String(s[startIndex ... i])
path.append(substring) path.append(substring) // 处理
} else {
continue
}
backtracking(startIndex: i + 1) // 寻找下一个起始位置的子串 backtracking(startIndex: i + 1) // 寻找下一个起始位置的子串
if !path.isEmpty { path.removeLast() } // 回溯 if !path.isEmpty { path.removeLast() } // 回溯
} }