add new solutions
This commit is contained in:
parent
0c73608ce5
commit
d798d5e8c9
19 changed files with 661 additions and 4 deletions
32
solutions/1/q148/solution.go
Normal file
32
solutions/1/q148/solution.go
Normal file
|
|
@ -0,0 +1,32 @@
|
|||
package q148
|
||||
|
||||
import "slices"
|
||||
|
||||
type ListNode struct {
|
||||
Val int
|
||||
Next *ListNode
|
||||
}
|
||||
|
||||
func sortList(head *ListNode) *ListNode {
|
||||
if head == nil {
|
||||
return nil
|
||||
}
|
||||
|
||||
arr := []*ListNode{}
|
||||
for head != nil {
|
||||
arr = append(arr, head)
|
||||
head = head.Next
|
||||
}
|
||||
|
||||
slices.SortFunc(arr, func(a, b *ListNode) int { return a.Val - b.Val })
|
||||
for i := range arr {
|
||||
if i == len(arr)-1 {
|
||||
arr[i].Next = nil
|
||||
} else {
|
||||
arr[i].Next = arr[i+1]
|
||||
}
|
||||
}
|
||||
return arr[0]
|
||||
}
|
||||
|
||||
var _ = sortList
|
||||
Loading…
Add table
Add a link
Reference in a new issue