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/continuous_subarr_sum.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/continuous_subarr_sum.cpp')
-rw-r--r-- | other/continuous_subarr_sum.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/other/continuous_subarr_sum.cpp b/other/continuous_subarr_sum.cpp deleted file mode 100644 index ceaf3ce..0000000 --- a/other/continuous_subarr_sum.cpp +++ /dev/null @@ -1,31 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool checkSubarraySum(vector<int> &nums, int k) { - unordered_map<int, int> um; - int s = 0; - um[0] = -1; - for (int i = 0; i < nums.size(); i++) { - s += nums[i]; - if (k != 0) - s %= k; - if (um.find(s) != um.end()) { - if (i - um[s] > 1) - return true; - } else - um[s] = i; - } - return false; - } -}; - -int main() { - Solution obj; - vector<int> nums = {23, 2, 4, 6, 7}; - int k = 6; - if (obj.checkSubarraySum(nums, k)) - cout << "true"; - else - cout << "false"; -} |