refactor 31

fishercoder1534 · fishercoder1534 · commit eb803661f02b · 2020-04-28T08:25:46.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_31.java b/src/main/java/com/fishercoder/solutions/_31.java
@@ -1,20 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 31. Next Permutation
-
-Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
-
-If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order).
-
-The replacement must be in-place, do not allocate extra memory.
-
-Here are some examples. Inputs are in the left-hand column and its corresponding outputs are in the right-hand column.
-1,2,3 → 1,3,2
-3,2,1 → 1,2,3
-1,1,5 → 1,5,1
- */
-
 public class _31 {
   public static class Solution1 {
     /**
