3 problems solved.

lintcoder · lintcoder · commit 34a48bacd134 · 2018-12-02T21:03:21.000+08:00
diff --git a/src/199.cpp b/src/199.cpp
@@ -0,0 +1,3 @@
+vector<int> rightSideView(TreeNode* root) {
+        
+    }
diff --git a/src/860.cpp b/src/860.cpp
@@ -0,0 +1,44 @@
+bool lemonadeChange(vector<int>& bills) {
+        int len = bills.size();
+        if (len == 0)
+        return true;
+        else if (len == 1)
+        return bills[0] == 5;
+
+        int change[3] = {0};
+        int i = 0;
+        while (i < len)
+        {
+            if (bills[i] == 5)
+            ++change[0];
+            else if (bills[i] == 10)
+            {
+                if (change[0] > 0)
+                {
+                    --change[0];
+                    ++change[1];
+                }
+                else
+                return false;
+            }
+            else
+            {
+                if (change[0] > 0 && change[1] > 0)
+                {
+                    --change[0];
+                    --change[1];
+                    ++change[2];
+                }
+                else if (change[0] >= 3)
+                {
+                    change[0] -= 3;
+                    ++change[2];
+                }
+                else
+                return false;
+            }
+            ++i;
+        }
+
+        return true;
+    }
diff --git a/src/888.cpp b/src/888.cpp
@@ -0,0 +1,39 @@
+vector<int> fairCandySwap(vector<int>& A, vector<int>& B) {
+        int len1 = A.size();
+        int len2 = B.size();
+        if (len1 == 1 && len2 == 1)
+        return {A[0], B[0]};
+
+        vector<int> res(2, 0);
+        int arr1[100001] = {0};
+        int arr2[100001] = {0};
+        int sum1 = 0, sum2 = 0;
+
+        for (int i = 0; i < len1; ++i)
+        {
+            sum1 += A[i];
+            ++arr1[A[i]];
+        }
+        for (int i = 0; i < len2; ++i)
+        {
+            sum2 += B[i];
+            ++arr2[B[i]];
+        }
+
+        int diff = (sum1 - sum2)/2;
+        int i = 0;
+        int k = 0;
+        while (i < len1)
+        {
+            if (diff < 0 && A[i]-diff <= 100000 && B[A[i]-diff] != 0)
+            break;
+            else if (diff > 0 && A[i] > diff && B[A[i]-diff] != 0)
+            break;
+            ++i;
+        }
+
+        res[0] = A[i];
+        res[1] = A[i]-diff;
+
+        return res;
+    }

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+vector<int> rightSideView(TreeNode* root) {`
	`2`	`+`
	`3`	`+ }`