mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 11:34:46 +08:00
更新 0077.组合优化.md cpp代码语法高亮
网站本文cpp代码没有语法高亮,推测网站可以识别```CPP(网站其它cpp代码均用```CPP标识),但无法识别```c++
This commit is contained in:
@ -20,7 +20,7 @@
|
||||
|
||||
大家先回忆一下[77. 组合]给出的回溯法的代码:
|
||||
|
||||
```c++
|
||||
```CPP
|
||||
class Solution {
|
||||
private:
|
||||
vector<vector<int>> result; // 存放符合条件结果的集合
|
||||
@ -52,7 +52,7 @@ public:
|
||||
|
||||
在遍历的过程中有如下代码:
|
||||
|
||||
```c++
|
||||
```CPP
|
||||
for (int i = startIndex; i <= n; i++) {
|
||||
path.push_back(i);
|
||||
backtracking(n, k, i + 1);
|
||||
@ -76,7 +76,7 @@ for (int i = startIndex; i <= n; i++) {
|
||||
**如果for循环选择的起始位置之后的元素个数 已经不足 我们需要的元素个数了,那么就没有必要搜索了**。
|
||||
|
||||
注意代码中i,就是for循环里选择的起始位置。
|
||||
```c++
|
||||
```CPP
|
||||
for (int i = startIndex; i <= n; i++) {
|
||||
```
|
||||
|
||||
@ -98,13 +98,13 @@ for (int i = startIndex; i <= n; i++) {
|
||||
|
||||
所以优化之后的for循环是:
|
||||
|
||||
```c++
|
||||
```CPP
|
||||
for (int i = startIndex; i <= n - (k - path.size()) + 1; i++) // i为本次搜索的起始位置
|
||||
```
|
||||
|
||||
优化后整体代码如下:
|
||||
|
||||
```c++
|
||||
```CPP
|
||||
class Solution {
|
||||
private:
|
||||
vector<vector<int>> result;
|
||||
|
Reference in New Issue
Block a user