refactor 283

fishercoder1534 · fishercoder1534 · commit cdee4748083f · 2020-05-28T10:21:29.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_283.java b/src/main/java/com/fishercoder/solutions/_283.java
@@ -1,15 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 283. Move Zeroes
- *
- * Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.
- *
- * For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].
- *
- * Note:
- * You must do this in-place without making a copy of the array.
- * Minimize the total number of operations.*/
 public class _283 {
     public static class Solution1 {
         public void moveZeroes(int[] nums) {
