Commit b81ce02

authored

feat: update solutions to lc problem: No.1863 (doocs#4328)

1 parent 30b9a8b commit b81ce02Copy full SHA for b81ce02

File tree

-3

lines changed

-3

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -286,7 +286,7 @@ public:`
`286`	`286`	`int subsetXORSum(vector<int>& nums) {`
`287`	`287`	`int n = nums.size();`
`288`	`288`	`int ans = 0;`
`289`		`- function<void(int, int)> dfs = [&](int i, int s) {`
	`289`	`+ auto dfs = [&](this auto&& dfs, int i, int s) {`
`290`	`290`	`if (i >= n) {`
`291`	`291`	`ans += s;`
`292`	`292`	`return;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -287,7 +287,7 @@ public:`
`287`	`287`	`int subsetXORSum(vector<int>& nums) {`
`288`	`288`	`int n = nums.size();`
`289`	`289`	`int ans = 0;`
`290`		`- function<void(int, int)> dfs = [&](int i, int s) {`
	`290`	`+ auto dfs = [&](this auto&& dfs, int i, int s) {`
`291`	`291`	`if (i >= n) {`
`292`	`292`	`ans += s;`
`293`	`293`	`return;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@ class Solution {`
`3`	`3`	`int subsetXORSum(vector<int>& nums) {`
`4`	`4`	`int n = nums.size();`
`5`	`5`	`int ans = 0;`
`6`		`- function<void(int, int)> dfs = [&](int i, int s) {`
	`6`	`+ autodfs = [&](thisauto&& dfs, int i, int s) {`
`7`	`7`	`if (i >= n) {`
`8`	`8`	`ans += s;`
`9`	`9`	`return;`

Comments

(0)