refaactor 441

fishercoder1534 · fishercoder1534 · commit 251564ec6201 · 2020-07-01T06:55:39.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_441.java b/src/main/java/com/fishercoder/solutions/_441.java
@@ -1,37 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 441. Arranging Coins
- *
- * You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.
-
- Given n, find the total number of full staircase rows that can be formed.
-
- n is a non-negative integer and fits within the range of a 32-bit signed integer.
-
- Example 1:
-
- n = 5
-
- The coins can form the following rows:
- ¤
- ¤ ¤
- ¤ ¤
-
- Because the 3rd row is incomplete, we return 2.
-
-
- Example 2:
-
- n = 8
-
- The coins can form the following rows:
- ¤
- ¤ ¤
- ¤ ¤ ¤
- ¤ ¤
-
- Because the 4th row is incomplete, we return 3.*/
 public class _441 {
 
     public static class Solution1 {
