Commit ed199f1

authored

更新 0077.组合优化.md cpp代码语法高亮

网站本文cpp代码没有语法高亮,推测网站可以识别```CPP(网站其它cpp代码均用```CPP标识),但无法识别```c++

1 parent e6a205d commit ed199f1Copy full SHA for ed199f1

File tree

-5

lines changed

-5

lines changed

Lines changed: 5 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -20,7 +20,7 @@`
`20`	`20`
`21`	`21`	`大家先回忆一下[77. 组合]给出的回溯法的代码:`
`22`	`22`
`23`		-```c++
	`23`	+```CPP
`24`	`24`	`class Solution {`
`25`	`25`	`private:`
`26`	`26`	`vector<vector<int>> result; // 存放符合条件结果的集合`
`@@ -52,7 +52,7 @@ public:`
`52`	`52`
`53`	`53`	`在遍历的过程中有如下代码:`
`54`	`54`
`55`		-```c++
	`55`	+```CPP
`56`	`56`	`for (int i = startIndex; i <= n; i++) {`
`57`	`57`	`path.push_back(i);`
`58`	`58`	`backtracking(n, k, i + 1);`
`@@ -76,7 +76,7 @@ for (int i = startIndex; i <= n; i++) {`
`76`	`76`	`如果for循环选择的起始位置之后的元素个数已经不足我们需要的元素个数了,那么就没有必要搜索了。`
`77`	`77`
`78`	`78`	`注意代码中i,就是for循环里选择的起始位置。`
`79`		-```c++
	`79`	+```CPP
`80`	`80`	`for (int i = startIndex; i <= n; i++) {`
`81`	`81`	```
`82`	`82`
`@@ -98,13 +98,13 @@ for (int i = startIndex; i <= n; i++) {`
`98`	`98`
`99`	`99`	`所以优化之后的for循环是:`
`100`	`100`
`101`		-```c++
	`101`	+```CPP
`102`	`102`	`for (int i = startIndex; i <= n - (k - path.size()) + 1; i++) // i为本次搜索的起始位置`
`103`	`103`	```
`104`	`104`
`105`	`105`	`优化后整体代码如下:`
`106`	`106`
`107`		-```c++
	`107`	+```CPP
`108`	`108`	`class Solution {`
`109`	`109`	`private:`
`110`	`110`	`vector<vector<int>> result;`

Comments

(0)