- 博客(30)
- 收藏
- 关注
原创 2022.7.30
class Solution { const int MOD = 1e9 + 7; public: int peopleAwareOfSecret(int n, int delay, int forget) { int f[n]; memset(f, 0, sizeof(f)); f[0] = 1; int cnt_b = 0; for (int i = 0; i < n; ++i) { if...
2022-07-30 12:28:44
77
原创 2022.7.22
class Solution { public: vector<int> plusOne(vector<int>& digits) { int n = digits.size(); for (int i = n - 1; i >= 0; --i) { if (digits[i] != 9) { ++digits[i]; for (int ...
2022-07-22 15:28:24
63
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人