Simplify sort code

Author: luliyucoordinate

src/0891-Sum-of-Subsequence-Widths/0891.go

@@ -1,5 +1,5 @@
 func sumSubseqWidths(A []int) int {
-    sort.Sort(IntSlice(A))
+    sort.Ints(A)
     res, n, mod := 0, len(A), 1000000007
     for i := 0; i < n; i++ {
         res *= 2
@@ -8,18 +8,4 @@ func sumSubseqWidths(A []int) int {
         res %= mod
     }
     return (res + mod) % mod
-}
-
-type IntSlice []int
-
-func (s IntSlice) Len() int {
-    return len(s)
-}
-
-func (s IntSlice) Swap(i, j int) {
-    s[i], s[j] = s[j], s[i]
-}
-
-func (s IntSlice) Less(i, j int) bool {
-    return s[i] < s[j]
 }

src/1170-Compare-Strings-by-Frequency-of-the-Smallest-Character/1170.go

@@ -16,7 +16,7 @@ func numSmallerByFrequency(queries []string, words []string) []int {
     for i, word := range words {
         w[i] = f(word)
     }
-    sort.Sort(IntSlice(w))
+    sort.Ints(w)
 
     for i, v := range queries {
         cnt, l, r := f(v), 0, len(w) - 1
@@ -35,10 +35,4 @@ func numSmallerByFrequency(queries []string, words []string) []int {
         res[i] = len(w) - l
     }
     return res
-}
-
-type IntSlice []int
- 
-func (s IntSlice) Len() int { return len(s) }
-func (s IntSlice) Swap(i, j int){ s[i], s[j] = s[j], s[i] }
-func (s IntSlice) Less(i, j int) bool { return s[i] < s[j] }
+}

src/1187-Make-Array-Strictly-Increasing/1187.go

@@ -1,6 +1,6 @@
 func makeArrayIncreasing(arr1 []int, arr2 []int) int {
     l1, l2 := len(arr1), len(arr2)
-    sort.Sort(IntSlice(arr2))
+    sort.Ints(arr2)
     dp := map[int]int{0:arr1[0], 1:arr2[0]}
     for i := 1; i < l1; i++ {
         ndp := make(map[int]int)
@@ -45,18 +45,4 @@ func min(a, b int) int {
         return a
     }
     return b
-}
-
-type IntSlice []int
-
-func (s IntSlice) Len() int {
-    return len(s)
-}
-
-func (s IntSlice) Swap(i, j int) {
-    s[i], s[j] = s[j], s[i]
-}
-
-func (s IntSlice) Less(i, j int) bool {
-    return s[i] < s[j]
 }

src/1196-How-Many-Apples-Can-You-Put-into-the-Basket/1196.go

@@ -1,5 +1,5 @@
 func maxNumberOfApples(arr []int) int {
-    sort.Sort(IntSlice(arr))
+    sort.Ints(arr)
     res, t := 0, 0
     for _, v := range arr {
         t += v
@@ -9,18 +9,4 @@ func maxNumberOfApples(arr []int) int {
         res++
     }
     return res
-}
-
-type IntSlice []int
-
-func (s IntSlice) Len() int {
-    return len(s)
-}
-
-func (s IntSlice) Swap(i, j int) {
-    s[i], s[j] = s[j], s[i]
-}
-
-func (s IntSlice) Less(i, j int) bool {
-    return s[i] < s[j]
 }

src/1200-Minimum-Absolute-Difference/1200.go

@@ -1,5 +1,5 @@
 func minimumAbsDifference(arr []int) [][]int {
-    sort.Sort(IntSlice(arr))
+    sort.Ints(arr)
     res := make([][]int, 0)
     min_dif := 10000000
     for i := 1; i < len(arr); i++ {
@@ -13,18 +13,4 @@ func minimumAbsDifference(arr []int) [][]int {
         res = append(res, []int{arr[i-1], arr[i]})
     }
     return res
-}
-
-type IntSlice []int
-
-func (s IntSlice) Len() int {
-    return len(s)
-}
-
-func (s IntSlice) Swap(i, j int) {
-    s[i], s[j] = s[j], s[i]
-}
-
-func (s IntSlice) Less(i, j int) bool {
-    return s[i] < s[j]
 }

src/1202-Smallest-String-With-Swaps/1202.go

@@ -19,7 +19,9 @@ func smallestStringWithSwaps(s string, pairs [][]int) string {
         mem[x] = append(mem[x], s[i])
     }
     for k, _ := range mem {
-        sort.Sort(IntSlice(mem[k]))
+        sort.Slice(mem[k], func(i, j int) bool {
+            return mem[k][i] < mem[k][j]
+        })
     }
 
     res := make([]byte, 0)
@@ -36,18 +38,4 @@ func find(x int) int {
         p[x] = find(p[x])
     }
     return p[x]
-}
-
-type IntSlice []byte
-
-func (s IntSlice) Len() int {
-    return len(s)
-}
-
-func (s IntSlice) Swap(i, j int) {
-    s[i], s[j] = s[j], s[i]
-}
-
-func (s IntSlice) Less(i, j int) bool {
-    return s[i] < s[j]
 }

src/1215-Stepping-Numbers/1215.go

@@ -7,7 +7,7 @@ func countSteppingNumbers(low int, high int) []int {
     for i := 0; i <= 9; i++ {
         bfs(i)
     }
-    sort.Sort(IntSlice(res))
+    sort.Ints(res)
     return res
 }
 
@@ -34,18 +34,4 @@ func bfs(s int) {
             q = append(q, s2)
         }
     }
-} 
-
-type IntSlice []int
-
-func (s IntSlice) Len() int {
-    return len(s)
-}
-
-func (s IntSlice) Swap(i, j int) {
-    s[i], s[j] = s[j], s[i]
-}
-
-func (s IntSlice) Less(i, j int) bool {
-    return s[i] < s[j]
-}
+}