Add solution 695 [Java]

Author: yanglbme

README.md

@@ -42,6 +42,7 @@ Complete [solutions](https://github.com/doocs/leetcode/tree/master/solution) to
 | 237 | [Delete Node in a Linked List](https://github.com/doocs/leetcode/tree/master/solution/237.Delete%20Node%20in%20a%20Linked%20List) | `Linked List` |
 | 344 | [Reverse String](https://github.com/doocs/leetcode/tree/master/solution/344.Reverse%20String) | `Two Pointers`, `String` |
 | 581 | [Shortest Unsorted Continuous Subarray](https://github.com/doocs/leetcode/tree/master/solution/581.Shortest%20Unsorted%20Continuous%20Subarray) | `Array` |
+| 605 | [Can Place Flowers](https://github.com/doocs/leetcode/tree/master/solution/605.Can%20Place%20Flowers) | `Array` |
 | 695 | [Max Area of Island](https://github.com/doocs/leetcode/tree/master/solution/695.Max%20Area%20of%20Island) | `Array`, `Depth-first Search` |
 | 703 | [Kth Largest Element in a Stream](https://github.com/doocs/leetcode/tree/master/solution/703.Kth%20Largest%20Element%20in%20a%20Stream) | `Heap` |
 | 707 | [Design Linked List](https://github.com/doocs/leetcode/tree/master/solution/707.Design%20Linked%20List) | `Linked List`, `Design` |
@@ -101,6 +102,8 @@ I'm looking for long-term contributors/partners to this repo! Send me [PRs](http
 - Fork this repository to your own GitHub account and then [clone](https://help.github.com/articles/cloning-a-repository/) it to your local device.
 - Submit a pull request with your changes!
 
+![how-to-contribute](http://p9ucdlghd.bkt.clouddn.com/how-to-contribute-yanglbme.png)
+
 ## Contributors
 
 " If you want to go fast, go alone. If you want to go far, go together. And that's the spirit of [teamwork](https://github.com/doocs/leetcode/graphs/contributors) ".

solution/605.Can Place Flowers/README.md

@@ -0,0 +1,47 @@
+## 种花问题
+### 题目描述
+
+假设你有一个很长的花坛，一部分地块种植了花，另一部分却没有。可是，花卉不能种植在相邻的地块上，它们会争夺水源，两者都会死去。
+
+给定一个花坛（表示为一个数组包含 0 和 1，其中 0 表示没种植花，1 表示种植了花），和一个数 `n` 。能否在不打破种植规则的情况下种入 `n` 朵花？能则返回 True，不能则返回 False。
+
+**示例 1:**
+```
+输入: flowerbed = [1,0,0,0,1], n = 1
+输出: True
+```
+
+**示例 2:**
+```
+输入: flowerbed = [1,0,0,0,1], n = 2
+输出: False
+```
+
+**注意:**
+
+- 数组内已种好的花不会违反种植规则。
+- 输入的数组长度范围为 [1, 20000]。
+- n 是非负整数，且不会超过输入数组的大小。
+
+### 解法
+遍历数组，若当前位置的元素为 0 并且左右元素也为 0，则该位置可以种花，计数器 +1。
+
+注意，需要特殊处理数组首尾元素。
+
+```java
+class Solution {
+    public boolean canPlaceFlowers(int[] flowerbed, int n) {
+        int len = flowerbed.length;
+        int cnt = 0;
+        for (int i = 0; i < len; ++i) {
+            if (flowerbed[i] == 0 
+                && (i == 0 || flowerbed[i - 1] == 0) 
+                && (i == len - 1 || flowerbed[i + 1] == 0)) {
+                ++cnt;
+                flowerbed[i] = 1;
+            }
+        }
+        return cnt >= n;
+    }
+}
+```

solution/605.Can Place Flowers/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public boolean canPlaceFlowers(int[] flowerbed, int n) {
+        int len = flowerbed.length;
+        int cnt = 0;
+        for (int i = 0; i < len; ++i) {
+            if (flowerbed[i] == 0 
+                && (i == 0 || flowerbed[i - 1] == 0) 
+                && (i == len - 1 || flowerbed[i + 1] == 0)) {
+                ++cnt;
+                flowerbed[i] = 1;
+            }
+        }
+        return cnt >= n;
+    }
+}