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

Update 0131.分割回文串.md

Browse Source 
一个笔误。
This commit is contained in:
weijiew
2021-05-07 18:23:05 +08:00
committed by GitHub
parent a3f3c07c7c
commit ee69e3166d
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -38,7 +38,7 @@
这种题目，想用for循环暴力解法，可能都不那么容易写出来，所以要换一种暴力的方式，就是回溯。
一些同学可能想不清楚 回溯究竟是如果切割字符串呢？
一些同学可能想不清楚 回溯究竟是如何切割字符串呢？
我们来分析一下切割，**其实切割问题类似组合问题**。