Merge pull request neetcode-gh#1575 from kabirdhillon7/734-C++

Create 724-Find-Pivot-Index.cpp

Author: caba5

cpp/605-Can-Place-Flowers.cpp

@@ -0,0 +1,32 @@
+class Solution {
+public:
+    bool canPlaceFlowers(vector<int>& flowerbed, int n) {
+        // pre-check, if n is 0 ... return true
+        if(n == 0){
+            return true;
+        }
+        
+        // add a zero to the front and end of FB
+        flowerbed.insert (flowerbed.begin(),0);
+        flowerbed.push_back(0);
+
+        // iterate through vector (1, vector -1) (for)
+        //  if prev, curr, and next are 0
+        //      plant flower (1)
+        //      decrement n
+        for(int i = 1; i < flowerbed.size() - 1; i++){
+            if (flowerbed[i - 1] == 0 && flowerbed[i] == 0 && flowerbed[i+1] == 0){
+                flowerbed[i] = 1;
+                n--;
+            }
+            if (n == 0){
+                return true;
+            }
+
+        }
+
+        // return false as else
+        return false;
+
+    }
+};

cpp/724-Find-Pivot-Index.cpp

@@ -0,0 +1,24 @@
+class Solution {
+public:
+  int pivotIndex(vector<int>& nums) {
+    int total;
+    for(int x: nums){
+      total += x;
+    }
+    
+    int leftSum = 0;
+    int rightSum;
+
+    for(int i = 0; i < nums.size(); i++){
+        rightSum = total - nums[i] - leftSum;
+
+        if(leftSum == rightSum){
+            return i;
+        }
+
+        leftSum += nums[i];
+      }
+
+      return -1;
+    }
+};