Add C++ Solution for 416 (fishercoder1534#78)

Anshul1507 · web-flow · commit 2e9432448d81 · 2020-07-03T10:10:46.000-07:00
* Create _416.cpp

* refactor 416
diff --git a/README.md b/README.md
@@ -580,7 +580,7 @@ _If you like this project, please leave me a star._ &#9733;
 |419|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_419.java) |  |Medium| DFS
 |418|[Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_418.java) |  |Medium| 
 |417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_417.java)  | |Medium| DFS
-|416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_416.java)|  |Medium | DP
+|416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_416.java), [C++](../master/cpp/_416.cpp)|  |Medium | DP
 |415|[Add Strings](https://leetcode.com/problems/add-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_415.java)|  |Easy|
 |414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_414.java)|  |Easy|
 |413|[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_413.java) |  |Medium| DP
diff --git a/cpp/_416.cpp b/cpp/_416.cpp
@@ -0,0 +1,42 @@
+//416. Partition Equal Subset Sum
+
+class Solution {
+public:
+    //maximum size top-down dp table
+    bool dp[201][20001];
+    
+    bool equalPart(vector<int>& arr,int size,int sum){
+        for(int i=0;i<=size;i++){
+            dp[i][0]=true;
+        }
+        for(int i=1;i<=sum;i++){
+            dp[0][i]=false;
+        }
+        
+        for(int i=1;i<=size;i++){
+            for(int j=1;j<=sum;j++){
+                 
+                if(arr[i-1]<=j){
+                    dp[i][j] = dp[i-1][j] || dp[i-1][j-arr[i-1]];
+                }else{
+                    dp[i][j] = dp[i-1][j];
+                }
+                
+            }
+        }
+        
+        return dp[size][sum];
+    }
+    
+    bool canPartition(vector<int>& nums) {
+        int sum=0;
+        for(int i=0;i<nums.size();i++){
+            sum+=nums[i];
+        }
+        if(sum%2!=0){
+            return false;
+        }else{
+            return equalPart(nums,nums.size(),sum/2);
+        }
+    }
+};
