delete some

Author: junl

alg-cpp.xcodeproj/project.xcworkspace/xcuserdata/junl.xcuserdatad/UserInterfaceState.xcuserstate

@@ -3,22 +3,4 @@
    uuid = "6057182A-5432-40CB-A6E9-927652D280FB"
    type = "0"
    version = "2.0">
-   <Breakpoints>
-      <BreakpointProxy
-         BreakpointExtensionID = "Xcode.Breakpoint.FileBreakpoint">
-         <BreakpointContent
-            uuid = "913CEDB4-C9B6-42F9-95F7-02DCA02D2CBF"
-            shouldBeEnabled = "Yes"
-            ignoreCount = "0"
-            continueAfterRunningActions = "No"
-            filePath = "../alg-cpp/main.cpp"
-            startingColumnNumber = "9223372036854775807"
-            endingColumnNumber = "9223372036854775807"
-            startingLineNumber = "69"
-            endingLineNumber = "69"
-            landmarkName = "reconstructQueue(people)"
-            landmarkType = "7">
-         </BreakpointContent>
-      </BreakpointProxy>
-   </Breakpoints>
 </Bucket>

alg-cpp.xcodeproj/project.xcworkspace/xcuserdata/junl.xcuserdatad/xcdebugger/Breakpoints_v2.xcbkptlist

@@ -69,51 +69,9 @@ class Solution {
         return people;
     }
 };
-class Solution2 {
-public:
-    bool canPartition(vector<int>& nums) {
-      int sum = 0;
-      for (auto &i : nums){
-          sum+=i;
-      }
-      if (sum & 0x1){
-          return false;
-      }
-      int v = sum / 2;
-      int idx = -1;
-      helper2(nums, idx, v);
-      return st;
-    }
-    void helper2(vector<int &> &nums,int idx, int sum){
-        if (sum == 0){
-            st = true;
-            return;
-        }
-    
-        for(int i=idx+1; i < nums.size();i++){
-            if(sum > nums[i]){
-                helper2(nums, i, sum - nums[i]);
-                helper2(nums, i, sum);
-            }
-        }
-    }
-    bool st;
-};
 int main(int argc, const char * argv[]) {
     // insert code here...
     std::string s{"aabccccaab"};
     std::cout << FilterRepeatString(s) << std::endl;
-    Solution so;
-//    string s2 = "3[a2[c]]";//"3[a2[c]]"
-//    s2 = so.decodeString(s2);
-    vector<vector<int>> r;
-    r.insert(r.begin()+2, {1});
-//    r.push_back({7,0});
-//    r.push_back({4,4});
-//    r.push_back({7,1});
-//    r.push_back({5,0});
-//    r.push_back({6,1});
-//    r.push_back({5,2});
-//    so.reconstructQueue(r);
     return 0;
 }