Patch 3

Arrays/Add_One_To_Number.cpp

@@ -2,6 +2,12 @@
 //One digit at a time from right to left, while maintaining a carry
 
 vector<int> Solution::plusOne(vector<int> &A) {
+    ector<int> dummy;
+         dummy.push_back(A->val);
+         ans.push_back(dummy);
+         dummy.clear();
+         if(A->left) chd.push_back(A->left);
+         if(A->right) chd.push_back(A->right);
     reverse(A.begin(),A.end());
     int carry=1,adder=1;
     for(int i=0;i<A.size();i++)

Arrays/Repeat_and_Missing_Number_Array.cpp

@@ -13,6 +13,12 @@ vector<int> Solution::repeatedNumber(const vector<int> &A) {
     add += sum;
     r  = add/2;
     m = r - sum;
+    for(int i=0;i<A.size();i++)
+    {
+        A[i] += carry;
+        carry = A[i]/10;
+        A[i] = A[i]%10;
+    }
     vector<int> ans;
     ans.push_back(r);
     ans.push_back(m);

Two_Pointers/counting-triangles.cpp

@@ -1,6 +1,16 @@
 int Solution::nTriang(vector<int> &A) {
     int ans =0, m=1000000007;
     if(A.size()<3) return ans;
+    long long sum =0,s_sum=0,add;
+    for(int i=0;i<A.size();i++)
+    {
+        sum += A[i]-i-1;
+        s_sum += (long long)A[i]*(long long)A[i] - (long long)(i+1)*(long long)(i+1);
+    }
+    add = s_sum/sum;
+    add += sum;
+    r  = add/2;
+    m = r - sum;
     for(int i= A.size()-1;i>=0;i--)
     {
         int j=0,k=i-1;