ssjssh
diff --git a/‎src/main/java/ssj/algorithm/ArrayUtil.java
Lines changed: 3 additions & 2 deletions b/‎src/main/java/ssj/algorithm/ArrayUtil.java
Lines changed: 3 additions & 2 deletions
diff --git a/‎src/main/java/ssj/algorithm/List.java
Lines changed: 2 additions & 4 deletions b/‎src/main/java/ssj/algorithm/List.java
Lines changed: 2 additions & 4 deletions
diff --git a/‎src/main/java/ssj/algorithm/collections/LinkedList.java
Lines changed: 1 addition & 2 deletions b/‎src/main/java/ssj/algorithm/collections/LinkedList.java
Lines changed: 1 addition & 2 deletions
diff --git a/‎src/main/java/ssj/algorithm/math/MathUtil.java
Lines changed: 1 addition & 1 deletion b/‎src/main/java/ssj/algorithm/math/MathUtil.java
Lines changed: 1 addition & 1 deletion
@@ -351,13 +351,14 @@ public static <T> T[] group(T[] arr, Function<? super T, ? extends Integer> func
             }
             set.add(ele);
         }
-        Iterator<HashSet<T>> iterator = static_map.valueIterator();
+
         int pos = 0;
-        while (iterator.hasNext()) {
+        for (Iterator<HashSet<T>> iterator = static_map.valueIterator(); iterator.hasNext(); ) {
             for (T ele : iterator.next()) {
                 arr[pos++] = ele;
             }
         }
+
         return arr;
     }
 
 
@@ -20,8 +20,7 @@ public interface List<T> extends Collection<T> {
 
     public default void delete(T ele) {
         Preconditions.checkNotNull(ele);
-        Iterator<T> iterator = iterator();
-        while (iterator.hasNext()) {
+        for (Iterator<T> iterator = iterator(); iterator.hasNext(); ) {
             if (Objects.equals(iterator.next(), ele)) {
                 iterator.remove();
             }
@@ -36,8 +35,7 @@ public default void delete(T ele) {
     public default int removeDuplicate() {
         int result = 0;
         HashSet<T> set = new HashSet<>(100);
-        Iterator<T> iterator = iterator();
-        while (iterator.hasNext()) {
+        for (Iterator<T> iterator = iterator(); iterator.hasNext(); ) {
             if (set.contains(iterator.next())) {
                 iterator.remove();
                 result++;
 
@@ -92,8 +92,7 @@ public void set(int index, T ele) {
     public void remove(int index) {
         Preconditions.checkPositionIndex(index, size());
         int cur_index = 0;
-        Iterator<T> iterator = iterator();
-        while (iterator.hasNext()) {
+        for (Iterator<T> iterator = iterator(); iterator.hasNext(); ) {
             if (cur_index == index) {
                 iterator.remove();
                 break;
 
@@ -177,7 +177,7 @@ private static int countNumberOneCore(String number) {
      * 同理：右边也是一样的：A1A2...Ax....Ay-1Ay...An < A1A2...Ax+1....Ay-1AxAy...An。
      * 综合三个等式得到：A1A2....Ax+1...Ay-1AyAx...An < A1A2...Ax+1....Ay-1AxAy...An。也就是AyAx < AxAy，这样
      * 显然和定义的比较规则相反，所以原假设不成立，证明了通过这样的排序规则得到的序列是最小的序列。
-     *
+     *  {{code shsi}}
      * @param arr
      * @return
      */
Original file line number	Diff line number	Diff line change
`@@ -351,13 +351,14 @@ public static <T> T[] group(T[] arr, Function<? super T, ? extends Integer> func`
`351`	`351`	`}`
`352`	`352`	`set.add(ele);`
`353`	`353`	`}`
`354`		`- Iterator<HashSet<T>> iterator = static_map.valueIterator();`
	`354`	`+`
`355`	`355`	`int pos = 0;`
`356`		`- while (iterator.hasNext()) {`
	`356`	`+ for (Iterator<HashSet<T>> iterator = static_map.valueIterator(); iterator.hasNext(); ) {`
`357`	`357`	`for (T ele : iterator.next()) {`
`358`	`358`	`arr[pos++] = ele;`
`359`	`359`	`}`
`360`	`360`	`}`
	`361`	`+`
`361`	`362`	`return arr;`
`362`	`363`	`}`
`363`	`364`