refactor 453

fishercoder1534 · fishercoder1534 · commit 7eef84ece534 · 2020-07-11T08:51:21.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_453.java b/src/main/java/com/fishercoder/solutions/_453.java
@@ -1,24 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 453. Minimum Moves to Equal Array Elements
- *
- * Given a non-empty integer array of size n,
- * find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.
-
- Example:
-
- Input:
- [1,2,3]
-
- Output:
- 3
-
- Explanation:
- Only three moves are needed (remember each move increments two elements):
-
- [1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]*/
-
 public class _453 {
     public static class Solution1 {
         /**
