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/tallest_billboard.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/tallest_billboard.cpp')
-rw-r--r-- | other/tallest_billboard.cpp | 26 |
1 files changed, 0 insertions, 26 deletions
diff --git a/other/tallest_billboard.cpp b/other/tallest_billboard.cpp deleted file mode 100644 index 1201823..0000000 --- a/other/tallest_billboard.cpp +++ /dev/null @@ -1,26 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int tallestBillboard(vector<int> &rods) { - unordered_map<int, int> dp; - dp[0] = 0; - for (int i : rods) { - unordered_map<int, int> tmp; - for (auto &it : dp) { - int diff = it.first; - tmp[diff + i] = max(tmp[diff + i], dp[diff] + i); - tmp[diff - i] = max(tmp[diff - i], dp[diff]); - } - dp.clear(); - dp.insert(tmp.begin(), tmp.end()); - } - return dp[0]; - } -}; - -int main() { - Solution obj; - vector<int> rods = {1, 2, 3, 6}; - cout << obj.tallestBillboard(rods); -} |