Commit ed344b3

raof01azl397985856

authored and

committed

feat: problem azl397985856#90 Add C++ implementation (azl397985856#172)

1 parent 25985e2 commit ed344b3Copy full SHA for ed344b3

File tree

+28

-0

lines changed

+28

-0

lines changed

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -46,6 +46,10 @@ Output:`
`46`	`46`
`47`	`47`	`## 代码`
`48`	`48`
	`49`	`+* 语言支持:JS,C++`
	`50`	`+`
	`51`	`+JavaScript Code:`
	`52`	`+`
`49`	`53`	```js
`50`	`54`
`51`	`55`
`@@ -104,6 +108,30 @@ var subsetsWithDup = function(nums) {`
`104`	`108`	`return list;`
`105`	`109`	`};`
`106`	`110`	```
	`111`	`+C++ Code:`
	`112`	`+`
	`113`	+```C++
	`114`	`+class Solution {`
	`115`	`+private:`
	`116`	`+ void subsetsWithDup(vector<int>& nums, size_t start, vector<int>& tmp, vector<vector<int>>& res) {`
	`117`	`+ res.push_back(tmp);`
	`118`	`+ for (auto i = start; i < nums.size(); ++i) {`
	`119`	`+ if (i > start && nums[i] == nums[i - 1]) continue;`
	`120`	`+ tmp.push_back(nums[i]);`
	`121`	`+ subsetsWithDup(nums, i + 1, tmp, res);`
	`122`	`+ tmp.pop_back();`
	`123`	`+ }`
	`124`	`+ }`
	`125`	`+public:`
	`126`	`+ vector<vector<int>> subsetsWithDup(vector<int>& nums) {`
	`127`	`+ auto tmp = vector<int>();`
	`128`	`+ auto res = vector<vector<int>>();`
	`129`	`+ sort(nums.begin(), nums.end());`
	`130`	`+ subsetsWithDup(nums, 0, tmp, res);`
	`131`	`+ return res;`
	`132`	`+ }`
	`133`	`+};`
	`134`	+```
`107`	`135`
`108`	`136`	`## 相关题目`
`109`	`137`

Comments

(0)