mirror of https://github.com/01-edu/public.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
59 lines
882 B
59 lines
882 B
5 years ago
|
## sortlinkedlist
|
||
|
|
||
|
### Instructions
|
||
|
|
||
|
You are given a linked list, where each node contains a single digit.
|
||
|
Write a function that sorts the list in descending order and return pointer/reference to new linked list
|
||
|
|
||
|
### Expected function and struct
|
||
|
|
||
|
```go
|
||
![]()
5 years ago
|
package main
|
||
5 years ago
|
|
||
5 years ago
|
type NodeAddL struct {
|
||
|
Next *NodeAddL
|
||
5 years ago
|
Num int
|
||
|
}
|
||
|
|
||
5 years ago
|
func Sortll(node *NodeAddL) *NodeAddL {
|
||
5 years ago
|
|
||
|
}
|
||
|
```
|
||
|
|
||
|
### Usage
|
||
5 years ago
|
|
||
5 years ago
|
Here is a possible program to test your function:
|
||
|
|
||
|
```go
|
||
|
package main
|
||
|
|
||
![]()
4 years ago
|
import "fmt"
|
||
5 years ago
|
|
||
|
// I implemented pushBack for this
|
||
|
|
||
|
func main() {
|
||
![]()
5 years ago
|
num1 := &NodeAddL{Num: 5}
|
||
5 years ago
|
num1 = pushBack(num1, 1)
|
||
|
num1 = pushBack(num1, 3)
|
||
|
num1 = pushBack(num1, 1)
|
||
|
num1 = pushBack(num1, 3)
|
||
|
|
||
![]()
5 years ago
|
result := Sortll(num1)
|
||
5 years ago
|
for tmp := result; tmp != nil; tmp = tmp.Next {
|
||
|
fmt.Print(tmp.Num)
|
||
|
if tmp.Next != nil {
|
||
|
fmt.Print(" -> ")
|
||
|
}
|
||
|
}
|
||
|
fmt.Println()
|
||
|
}
|
||
|
```
|
||
|
|
||
|
Its output:
|
||
|
|
||
|
```console
|
||
![]()
4 years ago
|
$ go build
|
||
|
$ ./main
|
||
5 years ago
|
5 -> 3 -> 3 -> 1 -> 1
|
||
|
```
|