diff options
author | Yuqian Yang <crupest@crupest.life> | 2025-02-28 23:13:39 +0800 |
---|---|---|
committer | Yuqian Yang <crupest@crupest.life> | 2025-02-28 23:13:39 +0800 |
commit | 99e2e923d0c77b02f3fb4ff648ea916954868606 (patch) | |
tree | ec8e03f6f2cd1ce43990fb4fe6cd631967d0237e /works/solutions/leetcode/cpp/213.cpp | |
parent | 1cee979f5d36b311a03cc7397a036ba11caf3d42 (diff) | |
download | crupest-99e2e923d0c77b02f3fb4ff648ea916954868606.tar.gz crupest-99e2e923d0c77b02f3fb4ff648ea916954868606.tar.bz2 crupest-99e2e923d0c77b02f3fb4ff648ea916954868606.zip |
chore(store): move everything to store.
Diffstat (limited to 'works/solutions/leetcode/cpp/213.cpp')
-rw-r--r-- | works/solutions/leetcode/cpp/213.cpp | 41 |
1 files changed, 0 insertions, 41 deletions
diff --git a/works/solutions/leetcode/cpp/213.cpp b/works/solutions/leetcode/cpp/213.cpp deleted file mode 100644 index cd98f67..0000000 --- a/works/solutions/leetcode/cpp/213.cpp +++ /dev/null @@ -1,41 +0,0 @@ -#include <vector>
-
-using std::vector;
-
-class Solution
-{
-public:
- int rob(vector<int> &nums)
- {
- int count = nums.size();
- if (count == 0)
- return 0;
-
- if (count == 1)
- return nums.front();
-
- int not_rob_prev = 0;
- int rob_prev = nums.front();
- int not_rob_prev_and_not_rob_first = 0;
- int rob_prev_and_not_rob_first = 0;
-
- for (int i = 1; i < count - 1; i++)
- {
- int not_rob_prev_cache = not_rob_prev;
- int not_rob_prev_and_not_rob_first_cache = not_rob_prev_and_not_rob_first;
- not_rob_prev = std::max(not_rob_prev_cache, rob_prev);
- rob_prev = std::max(not_rob_prev_cache + nums[i], not_rob_prev);
- not_rob_prev_and_not_rob_first = std::max(not_rob_prev_and_not_rob_first_cache, rob_prev_and_not_rob_first);
- rob_prev_and_not_rob_first = std::max(not_rob_prev_and_not_rob_first_cache + nums[i], not_rob_prev_and_not_rob_first);
- }
-
- // last houst
- {
- int not_rob_prev_and_not_rob_first_cache = not_rob_prev_and_not_rob_first;
- not_rob_prev_and_not_rob_first = std::max(not_rob_prev_and_not_rob_first_cache, rob_prev_and_not_rob_first);
- rob_prev_and_not_rob_first = std::max(not_rob_prev_and_not_rob_first_cache + nums[count - 1], not_rob_prev_and_not_rob_first);
- }
-
- return std::max(rob_prev, rob_prev_and_not_rob_first);
- }
-};
|