refactor 605

fishercoder1534 · fishercoder1534 · commit b7300893b5a5 · 2020-07-17T07:08:00.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_605.java b/src/main/java/com/fishercoder/solutions/_605.java
@@ -1,28 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 605. Can Place Flowers
- *
- * Suppose 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 - they would compete for water and both would die.
-
- Given a flowerbed (represented as an array containing 0 and 1, where 0 means empty and 1 means not empty),
- and a number n, return if n new flowers can be planted in it without violating the no-adjacent-flowers rule.
-
- Example 1:
- Input: flowerbed = [1,0,0,0,1], n = 1
- Output: True
-
- Example 2:
- Input: flowerbed = [1,0,0,0,1], n = 2
- Output: False
-
- Note:
- The input array won't violate no-adjacent-flowers rule.
- The input array size is in the range of [1, 20000].
- n is a non-negative integer which won't exceed the input array size.
-
- */
 public class _605 {
 
     public static class Solution1 {
