refactor 683

fishercoder1534 · fishercoder1534 · commit 81faf43f307a · 2020-07-20T06:50:53.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_683.java b/src/main/java/com/fishercoder/solutions/_683.java
@@ -1,43 +1,11 @@
 package com.fishercoder.solutions;
 
-/**
- * 683. K Empty Slots
- *
- *  There is a garden with N slots. In each slot, there is a flower.
- *
- *  The N flowers will bloom one by one in N days.
- *
- *  In each day, there will be exactly one flower blooming and it will be in the status of blooming since then.
- *
- *  Given an array flowers consists of number from 1 to N. Each number in the array represents the place where the flower will open in that day.
- *  For example, flowers[i] = x means that the unique flower that blooms at day i will be at position x,
- *  where i and x will be in the range from 1 to N.
- *
- *  Also given an integer k, you need to output in which day there exists two flowers in the status of blooming,
- *  and also the number of flowers between them is k and these flowers are not blooming.
- *  If there isn't such day, output -1.
-
- Example 1:
- Input:
- flowers: [1,3,2]
- k: 1
- Output: 2
- Explanation: In the second day, the first and the third flower have become blooming.
-
- Example 2:
- Input:
- flowers: [1,2,3]
- k: 1
- Output: -1
-
- Note:
- The given array will be in the range [1, 20000].
-
- */
 public class _683 {
 
     public static class Solution1 {
-        /**credit: https://discuss.leetcode.com/topic/104771/java-c-simple-o-n-solution*/
+        /**
+         * credit: https://discuss.leetcode.com/topic/104771/java-c-simple-o-n-solution
+         */
         public int kEmptySlots(int[] flowers, int k) {
             int[] days = new int[flowers.length];
             for (int i = 0; i < flowers.length; i++) {
