algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 17:44:10 +08:00
Code Issues Packages Projects Releases Wiki Activity

edit mainFunc name

Browse Source
This commit is contained in:
Alexander Chernikov
2020-12-21 17:55:24 +03:00
parent c18739f262
commit fcd2655a4a
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/0910-Smallest-Range-II/910.Smallest Range II.go
View File

@ -2,8 +2,8 @@ package leetcode
import "sort"
// SmallestRangeII ...
func SmallestRangeII(A []int, K int) int {
// smallestRangeII ...
func smallestRangeII(A []int, K int) int {
n := len(A)
sort.Ints(A)
var ans int = A[n-1] - A[0]

2
leetcode/0910-Smallest-Range-II/910.Smallest Range II_test.go
View File

@ -42,7 +42,7 @@ func Test_Problem910(t *testing.T) {
for _, q := range qs {
_, p := q.ans910, q.para910
fmt.Printf("【input】:%v 【output】:%v\n", p, SmallestRangeII(p.A, p.K))
fmt.Printf("【input】:%v 【output】:%v\n", p, smallestRangeII(p.A, p.K))
}
fmt.Printf("\n\n\n")
}