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

docs: 划分字母区间添加视频链接

Browse Source
This commit is contained in:
liangzhensheng
2023-03-17 11:32:37 +08:00
parent 403f524b3f
commit b0692bfa0d
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0763.划分字母区间.md
View File

@ -24,6 +24,10 @@
* S的长度在[1, 500]之间。
* S只包含小写字母 'a' 到 'z' 。
# 视频讲解
**《代码随想录》算法视频公开课：[贪心算法，寻找最远的出现位置！ LeetCode：763.划分字母区间](https://www.bilibili.com/video/BV18G4y1K7d5)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
## 思路
一想到分割字符串就想到了回溯，但本题其实不用回溯去暴力搜索。