Add solution #605

Author: JoshCrozier

README.md

@@ -205,6 +205,7 @@
 566|[Reshape the Matrix](./0566-reshape-the-matrix.js)|Easy|
 567|[Permutation in String](./0567-permutation-in-string.js)|Medium|
 599|[Minimum Index Sum of Two Lists](./0599-minimum-index-sum-of-two-lists.js)|Easy|
+605|[Can Place Flowers](./0605-can-place-flowers.js)|Easy|
 606|[Construct String from Binary Tree](./0606-construct-string-from-binary-tree.js)|Easy|
 617|[Merge Two Binary Trees](./0617-merge-two-binary-trees.js)|Easy|
 628|[Maximum Product of Three Numbers](./0628-maximum-product-of-three-numbers.js)|Easy|

solutions/0605-can-place-flowers.js

@@ -0,0 +1,28 @@
+/**
+ * 605. Can Place Flowers
+ * https://leetcode.com/problems/can-place-flowers/
+ * Difficulty: Easy
+ *
+ * You have a long flowerbed in which some of the plots are planted, and some are not.
+ * However, flowers cannot be planted in adjacent plots.
+ *
+ * Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1
+ * means not empty, and an integer n, return true if n new flowers can be planted in
+ * the flowerbed without violating the no-adjacent-flowers rule and false otherwise.
+ */
+
+/**
+ * @param {number[]} flowerbed
+ * @param {number} n
+ * @return {boolean}
+ */
+var canPlaceFlowers = function(flowerbed, n) {
+  let count = 0;
+  for (let i = 0; i < flowerbed.length; i++) {
+    if (flowerbed[i] === 0 && flowerbed[i - 1] !== 1 && flowerbed[i + 1] !== 1) {
+      count++;
+      flowerbed[i] = 1;
+    }
+  }
+  return count >= n;
+};