Skip to content

Commit 33f2047

Browse files
Nothing-avilNothing-avil
authored
Merge branch 'doocs:main' into main
2 parents 153e4f4 + 50d41c2 commit 33f2047

File tree

359 files changed

+40002
-30103
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

359 files changed

+40002
-30103
lines changed

‎images/starcharts.svg

Lines changed: 28845 additions & 28630 deletions
Loading

‎solution/0100-0199/0198.House Robber/README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -119,16 +119,16 @@ public:
119119
int n = nums.size();
120120
int f[n];
121121
memset(f, -1, sizeof(f));
122-
auto dfs = [&](auto&& dfs, int i) -> int {
122+
auto dfs = [&](this auto&& dfs, int i) -> int {
123123
if (i >= n) {
124124
return 0;
125125
}
126126
if (f[i] < 0) {
127-
f[i] = max(nums[i] + dfs(dfs, i + 2), dfs(dfs, i + 1));
127+
f[i] = max(nums[i] + dfs(i + 2), dfs(i + 1));
128128
}
129129
return f[i];
130130
};
131-
return dfs(dfs, 0);
131+
return dfs(0);
132132
}
133133
};
134134
```

‎solution/0100-0199/0198.House Robber/README_EN.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -118,16 +118,16 @@ public:
118118
int n = nums.size();
119119
int f[n];
120120
memset(f, -1, sizeof(f));
121-
auto dfs = [&](auto&& dfs, int i) -> int {
121+
auto dfs = [&](this auto&& dfs, int i) -> int {
122122
if (i >= n) {
123123
return 0;
124124
}
125125
if (f[i] < 0) {
126-
f[i] = max(nums[i] + dfs(dfs, i + 2), dfs(dfs, i + 1));
126+
f[i] = max(nums[i] + dfs(i + 2), dfs(i + 1));
127127
}
128128
return f[i];
129129
};
130-
return dfs(dfs, 0);
130+
return dfs(0);
131131
}
132132
};
133133
```

‎solution/0100-0199/0198.House Robber/Solution.cpp

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,15 +4,15 @@ class Solution {
44
int n = nums.size();
55
int f[n];
66
memset(f, -1, sizeof(f));
7-
auto dfs = [&](auto&& dfs, int i) -> int {
7+
auto dfs = [&](this auto&& dfs, int i) -> int {
88
if (i >= n) {
99
return 0;
1010
}
1111
if (f[i] < 0) {
12-
f[i] = max(nums[i] + dfs(dfs, i + 2), dfs(dfs, i + 1));
12+
f[i] = max(nums[i] + dfs(i + 2), dfs(i + 1));
1313
}
1414
return f[i];
1515
};
16-
return dfs(dfs, 0);
16+
return dfs(0);
1717
}
1818
};

‎solution/0200-0299/0233.Number of Digit One/README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -158,7 +158,7 @@ public:
158158
int m = s.size();
159159
int f[m][m];
160160
memset(f, -1, sizeof(f));
161-
auto dfs = [&](auto&& dfs, int i, int cnt, bool limit) -> int {
161+
auto dfs = [&](this auto&& dfs, int i, int cnt, bool limit) -> int {
162162
if (i >= m) {
163163
return cnt;
164164
}
@@ -168,14 +168,14 @@ public:
168168
int up = limit ? s[i] - '0' : 9;
169169
int ans = 0;
170170
for (int j = 0; j <= up; ++j) {
171-
ans += dfs(dfs, i + 1, cnt + (j == 1), limit && j == up);
171+
ans += dfs(i + 1, cnt + (j == 1), limit && j == up);
172172
}
173173
if (!limit) {
174174
f[i][cnt] = ans;
175175
}
176176
return ans;
177177
};
178-
return dfs(dfs, 0, 0, true);
178+
return dfs(0, 0, true);
179179
}
180180
};
181181
```

‎solution/0200-0299/0233.Number of Digit One/README_EN.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -158,7 +158,7 @@ public:
158158
int m = s.size();
159159
int f[m][m];
160160
memset(f, -1, sizeof(f));
161-
auto dfs = [&](auto&& dfs, int i, int cnt, bool limit) -> int {
161+
auto dfs = [&](this auto&& dfs, int i, int cnt, bool limit) -> int {
162162
if (i >= m) {
163163
return cnt;
164164
}
@@ -168,14 +168,14 @@ public:
168168
int up = limit ? s[i] - '0' : 9;
169169
int ans = 0;
170170
for (int j = 0; j <= up; ++j) {
171-
ans += dfs(dfs, i + 1, cnt + (j == 1), limit && j == up);
171+
ans += dfs(i + 1, cnt + (j == 1), limit && j == up);
172172
}
173173
if (!limit) {
174174
f[i][cnt] = ans;
175175
}
176176
return ans;
177177
};
178-
return dfs(dfs, 0, 0, true);
178+
return dfs(0, 0, true);
179179
}
180180
};
181181
```

‎solution/0200-0299/0233.Number of Digit One/Solution.cpp

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ class Solution {
55
int m = s.size();
66
int f[m][m];
77
memset(f, -1, sizeof(f));
8-
auto dfs = [&](auto&& dfs, int i, int cnt, bool limit) -> int {
8+
auto dfs = [&](this auto&& dfs, int i, int cnt, bool limit) -> int {
99
if (i >= m) {
1010
return cnt;
1111
}
@@ -15,13 +15,13 @@ class Solution {
1515
int up = limit ? s[i] - '0' : 9;
1616
int ans = 0;
1717
for (int j = 0; j <= up; ++j) {
18-
ans += dfs(dfs, i + 1, cnt + (j == 1), limit && j == up);
18+
ans += dfs(i + 1, cnt + (j == 1), limit && j == up);
1919
}
2020
if (!limit) {
2121
f[i][cnt] = ans;
2222
}
2323
return ans;
2424
};
25-
return dfs(dfs, 0, 0, true);
25+
return dfs(0, 0, true);
2626
}
2727
};

‎solution/0300-0399/0332.Reconstruct Itinerary/README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -131,16 +131,16 @@ public:
131131
g[ticket[0]].push_back(ticket[1]);
132132
}
133133
vector<string> ans;
134-
auto dfs = [&](auto&& dfs, string& f) -> void {
134+
auto dfs = [&](this auto&& dfs, string& f) -> void {
135135
while (!g[f].empty()) {
136136
string t = g[f].back();
137137
g[f].pop_back();
138-
dfs(dfs, t);
138+
dfs(t);
139139
}
140140
ans.emplace_back(f);
141141
};
142142
string f = "JFK";
143-
dfs(dfs, f);
143+
dfs(f);
144144
reverse(ans.begin(), ans.end());
145145
return ans;
146146
}

‎solution/0300-0399/0332.Reconstruct Itinerary/README_EN.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -129,16 +129,16 @@ public:
129129
g[ticket[0]].push_back(ticket[1]);
130130
}
131131
vector<string> ans;
132-
auto dfs = [&](auto&& dfs, string& f) -> void {
132+
auto dfs = [&](this auto&& dfs, string& f) -> void {
133133
while (!g[f].empty()) {
134134
string t = g[f].back();
135135
g[f].pop_back();
136-
dfs(dfs, t);
136+
dfs(t);
137137
}
138138
ans.emplace_back(f);
139139
};
140140
string f = "JFK";
141-
dfs(dfs, f);
141+
dfs(f);
142142
reverse(ans.begin(), ans.end());
143143
return ans;
144144
}

‎solution/0300-0399/0332.Reconstruct Itinerary/Solution.cpp

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -7,17 +7,17 @@ class Solution {
77
g[ticket[0]].push_back(ticket[1]);
88
}
99
vector<string> ans;
10-
auto dfs = [&](auto&& dfs, string& f) -> void {
10+
auto dfs = [&](this auto&& dfs, string& f) -> void {
1111
while (!g[f].empty()) {
1212
string t = g[f].back();
1313
g[f].pop_back();
14-
dfs(dfs, t);
14+
dfs(t);
1515
}
1616
ans.emplace_back(f);
1717
};
1818
string f = "JFK";
19-
dfs(dfs, f);
19+
dfs(f);
2020
reverse(ans.begin(), ans.end());
2121
return ans;
2222
}
23-
};
23+
};

0 commit comments

Comments
 (0)