![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/01\/20260123110422-697355b621019.png\")
<\/p>\n<\/p>\n<\/p>\n<\/p>\n
bool isPalindrome(string &s, int start, int end) \/\/ \u2705 \u5f15\u7528\u4f20\u9012 <\/p>\n
\u56e0\u4e3a：<\/p>\n
isPalindrome\u00a0\u53ea\u662f\u8bfb\u53d6\u5b57\u7b26\u4e32，\u4e0d\u4fee\u6539\u5b83<\/p>\n<\/li>\n
\u4f46\u6700\u597d\u52a0\u4e0a\u00a0const：bool isPalindrome(const string &s, …)<\/p>\n<\/li>\n
\/\/ \u4f7f\u7528 const &，\u56e0\u4e3a\u4e0d\u4fee\u6539\u5b57\u7b26\u4e32，\u53ea\u8bfb\u53d6
\nvoid backtracking(const string &s, int startIndex) <\/p>\n
\u4e3a\u4ec0\u4e48 partition \u51fd\u6570\u4e2d\u7684 s \u4e0d\u7528 &？<\/p>\n
vector<vector<string>> partition(string s) \/\/ \u8fd9\u91cc\u4e0d\u7528 & <\/p>\n
\u8c03\u7528\u8005\u4f20\u53c2\u7075\u6d3b：\u5982\u679c\u8fd9\u91cc\u7528\u00a0string &s，\u8c03\u7528\u8005\u5fc5\u987b\u4f20\u9012\u4e00\u4e2a\u5df2\u6709\u7684 string \u53d8\u91cf<\/p>\n
string str = "aab";
\npartition(str); \/\/ \u9700\u8981\u5df2\u6709\u53d8\u91cf <\/p>\n
\u53ef\u4ee5\u63a5\u53d7\u4e34\u65f6\u5bf9\u8c61：\u4e0d\u7528 & ，\u5373\u53ef\u4ee5\u63a5\u53d7\u4e34\u65f6\u521b\u5efa\u7684\u5b57\u7b26\u4e32<\/p>\n
partition("aab"); \/\/ \u4e34\u65f6\u5b57\u7b26\u4e32
\npartition(string("aab")); \/\/ \u4e34\u65f6\u5bf9\u8c61 <\/p>\n
string str = s.substr(startIndex, i – startIndex + 1); <\/p>\n
\u53c2\u6570\u8bf4\u660e：<\/p>\n
startIndex：\u5b50\u4e32\u7684\u8d77\u59cb\u4f4d\u7f6e（\u4ece0\u5f00\u59cb\u8ba1\u6570）<\/p>\n<\/li>\n
i – startIndex + 1：\u8981\u63d0\u53d6\u7684\u5b57\u7b26\u6570\u91cf（\u5b50\u4e32\u7684\u957f\u5ea6）<\/p>\n<\/li>\n<\/ul>\n
s.substr(startIndex); \/\/ \u63d0\u53d6\u4ecestartIndex\u5230\u5b57\u7b26\u4e32\u672b\u5c3e\u7684\u6240\u6709\u5b57\u7b26
\ns.substr(); \/\/ \u63d0\u53d6\u6574\u4e2a\u5b57\u7b26\u4e32 <\/p>\n
\u4ece\u6811\u5f62\u7ed3\u6784\u7684\u56fe\u4e2d\u53ef\u4ee5\u770b\u51fa：\u5207\u5272\u7ebf\u5207\u5230\u4e86\u5b57\u7b26\u4e32\u6700\u540e\u9762，\u8bf4\u660e\u627e\u5230\u4e86\u4e00\u79cd\u5207\u5272\u65b9\u6cd5，\u6b64\u65f6\u5c31\u662f\u672c\u5c42\u9012\u5f52\u7684\u7ec8\u6b62\u6761\u4ef6\u3002<\/p>\n
\u5728\u5904\u7406\u7ec4\u5408\u95ee\u9898\u7684\u65f6\u5019，\u9012\u5f52\u53c2\u6570\u9700\u8981\u4f20\u5165startIndex，\u8868\u793a\u4e0b\u4e00\u8f6e\u9012\u5f52\u904d\u5386\u7684\u8d77\u59cb\u4f4d\u7f6e，\u8fd9\u4e2astartIndex\u5c31\u662f\u5207\u5272\u7ebf\u3002<\/p>\n
\u5728\u9012\u5f52\u5faa\u73af\u4e2d\u5982\u4f55\u622a\u53d6\u5b50\u4e32\u5462？<\/p>\n
\u5728for (int i = startIndex; i < s.size(); i++)\u5faa\u73af\u4e2d，\u6211\u4eec \u5b9a\u4e49\u4e86\u8d77\u59cb\u4f4d\u7f6estartIndex，\u90a3\u4e48 [startIndex, i] \u5c31\u662f\u8981\u622a\u53d6\u7684\u5b50\u4e32\u3002<\/p>\n
\u6240\u4ee5\u5b50\u4e32\u7684\u957f\u5ea6\u4e3a i – startIndex+1<\/p>\n
\u9996\u5148\u5224\u65ad\u8fd9\u4e2a\u5b50\u4e32\u662f\u4e0d\u662f\u56de\u6587，\u5982\u679c\u662f\u56de\u6587，\u5c31\u52a0\u5165\u5728vector<string> path\u4e2d，path\u7528\u6765\u8bb0\u5f55\u5207\u5272\u8fc7\u7684\u56de\u6587\u5b50\u4e32\u3002<\/p>\n
class Solution {
\nprivate:
\n vector<vector<string>> result; \/\/ \u5b58\u50a8\u6240\u6709\u53ef\u80fd\u7684\u5206\u5272\u65b9\u6848
\n vector<string> path; \/\/ \u5b58\u50a8\u5f53\u524d\u5206\u5272\u65b9\u6848\u4e2d\u7684\u56de\u6587\u5b50\u4e32
\n void backtracking (const string& s, int startIndex) {
\n \/\/ \u5982\u679c\u8d77\u59cb\u4f4d\u7f6e\u5df2\u7ecf\u5927\u4e8e\u7b49\u4e8es\u7684\u957f\u5ea6，\u8bf4\u660e\u5df2\u7ecf\u5206\u5272\u5230\u5b57\u7b26\u4e32\u672b\u5c3e
\n if (startIndex >= s.size()) {
\n result.push_back(path); \/\/ \u5c06\u5f53\u524d\u5206\u5272\u65b9\u6848\u52a0\u5165\u7ed3\u679c\u96c6
\n return;
\n }
\n \/\/ \u4ecestartIndex\u5f00\u59cb\u5c1d\u8bd5\u6240\u6709\u53ef\u80fd\u7684\u5206\u5272\u70b9
\n for (int i = startIndex; i < s.size(); i++) {
\n \/\/ \u68c0\u67e5s[startIndex]\u5230s[i]\u7684\u5b50\u4e32\u662f\u5426\u662f\u56de\u6587
\n if (isPalindrome(s, startIndex, i)) {
\n \/\/ \u83b7\u53d6\u56de\u6587\u5b50\u4e32
\n string str = s.substr(startIndex, i – startIndex + 1);
\n path.push_back(str); \/\/ \u5c06\u56de\u6587\u5b50\u4e32\u52a0\u5165\u5f53\u524d\u8def\u5f84
\n } else { \/\/ \u4e0d\u662f\u56de\u6587，\u8df3\u8fc7\u5f53\u524d\u5206\u5272\u70b9
\n continue;
\n }
\n backtracking(s, i + 1); \/\/ \u9012\u5f52\u5904\u7406\u5269\u4f59\u5b50\u4e32，\u4ecei+1\u5f00\u59cb
\n path.pop_back(); \/\/ \u56de\u6eaf：\u79fb\u9664\u6700\u540e\u6dfb\u52a0\u7684\u5b50\u4e32，\u5c1d\u8bd5\u5176\u4ed6\u5206\u5272\u53ef\u80fd
\n }
\n }
\n \/\/ \u5224\u65ad\u5b50\u4e32s[start…end]\u662f\u5426\u662f\u56de\u6587
\n bool isPalindrome(const string& s, int start, int end) {
\n \/\/ \u53cc\u6307\u9488\u6cd5\u5224\u65ad\u56de\u6587
\n for (int i = start, j = end; i < j; i++, j–) {
\n if (s[i] != s[j]) {
\n return false; \/\/ \u6709\u5b57\u7b26\u4e0d\u76f8\u7b49，\u4e0d\u662f\u56de\u6587
\n }
\n }
\n return true; \/\/ \u6240\u6709\u5b57\u7b26\u90fd\u5bf9\u79f0，\u662f\u56de\u6587
\n }
\npublic:
\n vector<vector<string>> partition(string s) {
\n \/\/ \u6e05\u7a7a\u7ed3\u679c\u96c6\u548c\u8def\u5f84，\u9632\u6b62\u591a\u6b21\u8c03\u7528\u65f6\u6570\u636e\u6b8b\u7559
\n result.clear();
\n path.clear();
\n \/\/ \u4ece\u7d22\u5f150\u5f00\u59cb\u56de\u6eaf\u5206\u5272
\n backtracking(s, 0);
\n return result; \/\/ \u8fd4\u56de\u6240\u6709\u5206\u5272\u65b9\u6848
\n }
\n};<\/p>\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/01\/20260123110422-697355b6518ae.png\")
<\/p>\n
\u4e3e\u4e00\u4e2a\u5177\u4f53\u4f8b\u5b50，\u8f93\u5165：s = "aab"，\u6765\u6a21\u62df\u4e0a\u8ff0\u4ee3\u7801\u6d41\u7a0b<\/p>\n
s = "aab"
\n\u8c03\u7528 partition("aab") <\/p>\n
result.clear() \u2192 result = []
\npath.clear() \u2192 path = []
\n\u8c03\u7528 backtracking(s, 0)<\/p>\n
if (startIndex >= s.size()) {
\n result.push_back(path); \/\/ \u5c06\u5f53\u524d\u5206\u5272\u65b9\u6848\u52a0\u5165\u7ed3\u679c\u96c6
\n return;
\n}
\n startIndex = 0 , s.size() = 3
\nif (0 >= 3)\u4e0d\u6ee1\u8db3if\u8bed\u53e5<\/p>\n
for (int i = startIndex; i < s.size(); i++) { startIndex = 1 if (isPalindrome(s, startIndex, i)) { startIndex = 2 startIndex = 3 if (startIndex >= s.size()) { backtracking(s, i + 1); \/\/ \u9012\u5f52\u5904\u7406\u5269\u4f59\u5b50\u4e32，\u4ecei+1\u5f00\u59cb \/\/ \u7ee7\u7eed\u6267\u884c backtracking(s, i+1) \u540e\u9762\u7684\u4ee3\u7801：<\/span> continue\u00a0\u8bed\u53e5\u7684\u4f5c\u7528：<\/p>\n \u8df3\u8fc7\u5f53\u524d\u5faa\u73af\u4e2d\u5269\u4f59\u7684\u4ee3\u7801<\/p>\n<\/li>\n \u76f4\u63a5\u8fdb\u5165\u4e0b\u4e00\u6b21\u5faa\u73af\u8fed\u4ee3<\/p>\n<\/li>\n \u8fd9\u610f\u5473\u7740：<\/p>\n \u4e0d\u4f1a\u6267\u884c\u00a0backtracking(s, i + 1)（\u5373\u00a0backtracking(s, 3)）<\/p>\n<\/li>\n \u4e0d\u4f1a\u6267\u884c\u8fd9\u4e2a\u5206\u652f\u7684\u00a0path.pop_back()<\/p>\n<\/li>\n \u76f4\u63a5\u8fdb\u5165\u00a0i++<\/p>\n<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n path.pop_back(); \u4e4b\u524d\u524d path = ["a"]，\u73b0\u5728\u79fb\u9664\u6700\u540e\u4e00\u4e2a\u5143\u7d20，\u73b0\u5728path = [] startIndex = 2 for \u5faa\u73af\u5f00\u59cb：i = 2 \u5230 2 ………<\/p>\n ………<\/p>\n ………<\/p>\n ………<\/p>\n","protected":false},"excerpt":{"rendered":" bool isPalindrome(string &s, int start, int end) \/\/ \u2705 \u5f15\u7528\u4f20\u9012
\n \/\/ \u68c0\u67e5s[startIndex]\u5230s[i]\u7684\u5b50\u4e32\u662f\u5426\u662f\u56de\u6587
\n if (isPalindrome(s, startIndex, i)) {
\n \/\/ \u83b7\u53d6\u56de\u6587\u5b50\u4e32
\n string str = s.substr(startIndex, i – startIndex + 1);
\n path.push_back(str); \/\/ \u5c06\u56de\u6587\u5b50\u4e32\u52a0\u5165\u5f53\u524d\u8def\u5f84
\n } else { \/\/ \u4e0d\u662f\u56de\u6587，\u8df3\u8fc7\u5f53\u524d\u5206\u5272\u70b9
\n continue;
\n }
\n backtracking(s, i + 1); \/\/ \u9012\u5f52\u5904\u7406\u5269\u4f59\u5b50\u4e32，\u4ecei+1\u5f00\u59cb
\n path.pop_back(); \/\/ \u56de\u6eaf：\u79fb\u9664\u6700\u540e\u6dfb\u52a0\u7684\u5b50\u4e32，\u5c1d\u8bd5\u5176\u4ed6\u5206\u5272\u53ef\u80fd
\n}
\n for \u5faa\u73af\u5f00\u59cb：i=0 \u5230 2
\n\u73b0\u5728i=0<\/span>
\n\u8c03\u7528 isPalindrome(s, 0, 0):
\n \u6bd4\u8f83 s[0]='a' \u548c s[0]='a' \u2192 true
\nif (true) \u2192 \u8fdb\u5165if\u5757
\nstr = s.substr(0, 1) = "a"
\npath.push_back("a") \u2192 path = ["a"]
\n\u8c03\u7528 backtracking(s, 1) <\/p>\n<\/p>\n\u7b2c3\u6b65：backtracking(s, 1)<\/h3>\n
\nif (1 >= 3)\u4e0d\u6ee1\u8db3if\u6761\u4ef6
\n\u6267\u884cfor\u5faa\u73af
\nfor \u5faa\u73af\u5f00\u59cb：i = 1 \u5230 2
\n\u73b0\u5728i=1
\n<\/span>\u5224\u65ad<\/span>if (isPalindrome(s, startIndex, i))
\n\u51fd\u6570isPalindrome(s, 1, 1):
\n \u6bd4\u8f83 s[1]='a' \u548c s[1]='a' \u2192 true
\nif (true) \u2192 \u6240\u4ee5\u8fdb\u5165if\u8bed\u53e5<\/p>\n
\n \/\/ \u83b7\u53d6\u56de\u6587\u5b50\u4e32
\n string str = s.substr(startIndex, i – startIndex + 1);
\n path.push_back(str); \/\/ \u5c06\u56de\u6587\u5b50\u4e32\u52a0\u5165\u5f53\u524d\u8def\u5f84
\n str = s.substr(1, 1) = "a"（\u4eces[1]\u5f00\u59cb，\u53d6\u4e00\u4e2a\u5b57\u7b26）
\npath.push_back("a") \u2192 path = ["a", "a"]
\n\u8c03\u7528 backtracking(s, 2) <\/p>\n\u7b2c4\u6b65：backtracking(s, 2)<\/h3>\n
\nif (2 >= 3)\u4e0d\u6ee1\u8db3if\u6761\u4ef6
\n\u6240\u4ee5\u6267\u884cfor\u5faa\u73af
\nfor \u5faa\u73af\u5f00\u59cb：i = 2 \u5230 2
\n\u73b0\u5728i=2<\/span>
\n\u8c03\u7528 isPalindrome(s, 2, 2):
\n \u6bd4\u8f83 s[2]='b' \u548c s[2]='b' \u2192 true
\nif (true) \u2192 \u8fdb\u5165if\u8bed\u53e5
\nstr = s.substr(2, 1) = "b"（\u4eces[2]\u53d61\u4e2a\u5b57\u7b26）
\npath.push_back("b") \u2192 path = ["a", "a", "b"]
\n\u8c03\u7528 backtracking(s, 3) <\/p>\n\u7b2c5\u6b65：backtracking(s, 3)<\/h3>\n
\nif (3 >= 3) \u6ee1\u8db3if\u8bed\u53e5true \u2192 \u8fdb\u5165if<\/p>\n
\n result.push_back(path); \/\/ \u5c06\u5f53\u524d\u5206\u5272\u65b9\u6848\u52a0\u5165\u7ed3\u679c\u96c6
\n return;
\n}
\n result.push_back(path) \u2192 result = [["a", "a", "b"]]
\nreturn \u5230\u4e0a\u4e00\u5c42（backtracking(s, 2)） <\/p>\n\u7b2c6\u6b65：\u56de\u5230 backtracking(s, 2)<\/h3>\n
\n path.pop_back(); \/\/ \u56de\u6eaf：\u79fb\u9664\u6700\u540e\u6dfb\u52a0\u7684\u5b50\u4e32，\u5c1d\u8bd5\u5176\u4ed6\u5206\u5272\u53ef\u80fd
\n \u7ee7\u7eed\u6267\u884c backtracking(s, i+1) \u540e\u9762\u7684\u4ee3\u7801：
\npath.pop_back() \u2192 \u4e4b\u540epath = ["a", "a"]
\ni++ \u2192 i=3<\/span>，\u4e0d\u518d\u6ee1\u8db3for\u5faa\u73af\u6761\u4ef6，\u5faa\u73af\u7ed3\u675f
\nreturn \u5230\u4e0a\u4e00\u5c42（backtracking(s, 1)） <\/p>\n\u7b2c7\u6b65：\u56de\u5230 backtracking(s, 1)<\/h3>\n
\n\/\/ \u8fd9\u91cc\u7684 i = 1，\u56e0\u4e3a\u8fd9\u662f i = 1 \u8fd9\u4e2a\u5faa\u73af\u5206\u652f
\npath.pop_back();
\n\u4e4b\u524d path = ["a", "a"]
\npop\u79fb\u9664\u6700\u540e\u4e00\u4e2a\u5143\u7d20 \u2192 \u73b0\u5728path = ["a"]
\n for \u5faa\u73af\u7ee7\u7eed i++; \/\/ i \u4ece 1 \u53d8\u6210 2<\/span>
\n\u68c0\u67e5for\u5faa\u73af\u6761\u4ef6：i < s.size() -> 2 < 3 \u6ee1\u8db3for\u5faa\u73af\u6761\u4ef6true
\n\u6240\u4ee5\u8fdb\u5165for\u5faa\u73af：\u73b0\u5728i = 2 ，<\/span>startIndex \u4ecd\u4e3a 1
\n for (int i = startIndex; i < s.size(); i++) {
\n \/\/ \u68c0\u67e5s[startIndex]\u5230s[i]\u7684\u5b50\u4e32\u662f\u5426\u662f\u56de\u6587
\n if (isPalindrome(s, startIndex, i)) {
\n \/\/ \u83b7\u53d6\u56de\u6587\u5b50\u4e32
\n string str = s.substr(startIndex, i – startIndex + 1);
\n path.push_back(str); \/\/ \u5c06\u56de\u6587\u5b50\u4e32\u52a0\u5165\u5f53\u524d\u8def\u5f84
\n } else { \/\/ \u4e0d\u662f\u56de\u6587，\u8df3\u8fc7\u5f53\u524d\u5206\u5272\u70b9
\n continue;
\n }
\n backtracking(s, i + 1); \/\/ \u9012\u5f52\u5904\u7406\u5269\u4f59\u5b50\u4e32，\u4ecei+1\u5f00\u59cb
\n path.pop_back(); \/\/ \u56de\u6eaf：\u79fb\u9664\u6700\u540e\u6dfb\u52a0\u7684\u5b50\u4e32，\u5c1d\u8bd5\u5176\u4ed6\u5206\u5272\u53ef\u80fd
\n}
\n \u8c03\u7528 isPalindrome(s, 1, 2):（\u4eces[1]\u5f00\u59cb\u53d62\u4e2a\u5b57\u7b26）"ab"
\n \u6bd4\u8f83 s[1]='a' \u548c s[2]='b' \u2192 false （"ab"\u4e0d\u662f\u56de\u6587，\u8fd4\u56de\u00a0false）
\nif (false) \u2192 \u6267\u884ccontinue
\ni++ \u2192 i=3，\u4e0d\u6ee1\u8db3for\u5faa\u73af\u6761\u4ef6，\u5faa\u73af\u7ed3\u675f\u3002for\u5faa\u73af\u7ed3\u675f\u540e，\u5373backtracking(s, 1)\u51fd\u6570\u6267\u884c\u5b8c\u6bd5\u3002\u6240\u4ee5\u8fd4\u56de\u5230\u8c03\u7528\u8005：backtracking(s, 0)
\n\u6267\u884c path.pop_back() \u2192 path = ["a"]
\nreturn \u5230\u4e0a\u4e00\u5c42（backtracking(s, 0)）
\n \u79fb\u9664 "a"，path = [] <\/p>\n\n
\n
\u7b2c8\u6b65：\u56de\u5230 backtracking(s, 0)<\/h3>\n
\ni = 0 \u7684\u5faa\u73af\u7ed3\u675f
\ni++ \u2192 \u73b0\u5728i = 1<\/span>
\n\u8c03\u7528 isPalindrome(s, 0, 1):
\n \u6bd4\u8f83 s[0]='a' \u548c s[1]='a' \u2192 true
\nif (true) \u2192 \u8fdb\u5165if\u8bed\u53e5
\nstr = s.substr(0, 2) = "aa"
\npath.push_back("aa") \u2192 path = ["aa"]
\n\u8c03\u7528 backtracking(s, 2) <\/p>\n\u7b2c9\u6b65：backtracking(s, 2)<\/h3>\n
\nif (2 >= 3) \u4e0d\u6ee1\u8db3if\u6761\u4ef6\u5224\u65ad<\/p>\n
\n\u8c03\u7528 isPalindrome(s, 2, 2):
\n \u6bd4\u8f83 s[2]='b' \u548c s[2]='b' \u2192 true
\nif (true) \u2192 \u8fdb\u5165if\u5757
\nstr = s.substr(2, 1) = "b"
\npath.push_back("b") \u2192 path = ["aa", "b"]
\n\u8c03\u7528 backtracking(s, 3) <\/p>\n
\n\u56e0\u4e3a： isPalindrome\u00a0\u53ea\u662f\u8bfb\u53d6\u5b57\u7b26\u4e32，\u4e0d\u4fee\u6539\u5b83 \u4f46\u6700\u597d\u52a0\u4e0a\u00a0const：bool isPalindrome(const string &s, …)
\n\/\/ \u4f7f\u7528 const &，\u56e0\u4e3a\u4e0d\u4fee\u6539\u5b57\u7b26\u4e32，\u53ea\u8bfb\u53d6
\nvoid backtracking(const string &<\/p>\n","protected":false},"author":2,"featured_media":64557,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[6831,2692,1813,427],"topic":[],"class_list":["post-64559","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-server","tag-6831","tag-leetcode","tag-1813","tag-427"],"yoast_head":"\n