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/construct_array_multiple_sum.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/construct_array_multiple_sum.cpp')
-rw-r--r-- | other/construct_array_multiple_sum.cpp | 30 |
1 files changed, 0 insertions, 30 deletions
diff --git a/other/construct_array_multiple_sum.cpp b/other/construct_array_multiple_sum.cpp deleted file mode 100644 index 5d2751d..0000000 --- a/other/construct_array_multiple_sum.cpp +++ /dev/null @@ -1,30 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool isPossible(vector<int> &target) { - long total = 0; - int i; - priority_queue<int> pq(target.begin(), target.end()); - for (int i : target) - total += i; - while (true) { - i = pq.top(); - pq.pop(); - total -= i; - if (i == 1 || total == 1) - return true; - if (i < total || total == 0 || i % total == 0) - return false; - i %= total; - total += i; - pq.push(i); - } - } -}; - -int main() { - Solution obj; - vector<int> target = {9, 3, 5}; - cout << obj.isPossible(target); -} |