Add 523

Author: moranzcw

Algorithms/523.Continuous-Subarray-Sum/solution.cpp

@@ -0,0 +1,24 @@
+class Solution {
+public:
+    bool checkSubarraySum(vector<int>& nums, int k) {
+        bool flag = false;
+        if(k==0)
+            flag = true;
+        vector<int> dp(nums.size(),0);
+        for(int i=0;i<nums.size();i++){
+            int sum = nums[i];
+            for(int j=i+1;j<nums.size();j++){
+                sum += nums[j];
+                if(flag){
+                    if(sum - k == 0)
+                        return true;
+                }
+                else{
+                    if (sum % k == 0)
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+};

README.md

@@ -577,6 +577,8 @@
 
 [506.Relative-Ranks](Algorithms/506.Relative-Ranks/solution.cpp)
 
+[523.Continuous-Subarray-Sum](Algorithms/523.Continuous-Subarray-Sum/solution.cpp)
+
 [645.Set-Mismatch](Algorithms/645.Set-Mismatch/solution.cpp)
 
 [674.Longest-Continuous-Increasing-Subsequence](Algorithms/674.Longest-Continuous-Increasing-Subsequence/solution.cpp)