diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/house_robber.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/house_robber.cpp')
-rw-r--r-- | other/house_robber.cpp | 21 |
1 files changed, 0 insertions, 21 deletions
diff --git a/other/house_robber.cpp b/other/house_robber.cpp deleted file mode 100644 index a08aa54..0000000 --- a/other/house_robber.cpp +++ /dev/null @@ -1,21 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int rob(vector<int> &nums) { - // space-optimized dynamic programming approach - int prev = 0, prev2 = 0, curr = 0; - for (auto i : nums) { - curr = max(prev, i + prev2); - prev2 = prev; - prev = curr; - } - return curr; - } -}; - -int main() { - Solution obj; - vector<int> nums = {1, 2, 3, 1}; - cout << obj.rob(nums); // expect 4 -} |