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.
62 lines
988 B
62 lines
988 B
5 years ago
|
## reverse
|
||
5 years ago
|
|
||
|
### Instructions
|
||
|
|
||
|
You are given a linked list, where each node contains a single digit.
|
||
|
Write a function that reverses the list and returns pointer/reference to new linked list
|
||
|
|
||
5 years ago
|
### Expected function and structure
|
||
5 years ago
|
|
||
|
```go
|
||
5 years ago
|
package main
|
||
5 years ago
|
|
||
5 years ago
|
type NodeAddL struct {
|
||
5 years ago
|
Next *NodeAddL
|
||
|
Num int
|
||
5 years ago
|
}
|
||
|
|
||
5 years ago
|
func Reverse(node *NodeAddL) *NodeAddL {
|
||
5 years ago
|
|
||
|
}
|
||
|
```
|
||
|
|
||
|
### Usage
|
||
5 years ago
|
|
||
|
Here is a possible program to test your function :
|
||
5 years ago
|
|
||
|
```go
|
||
|
package main
|
||
|
|
||
5 years ago
|
import "fmt"
|
||
5 years ago
|
|
||
5 years ago
|
func pushBack(n *NodeAddL, num int) *NodeAddL{
|
||
5 years ago
|
|
||
|
}
|
||
5 years ago
|
|
||
|
func main() {
|
||
5 years ago
|
num1 := &piscine.NodeAddL{Num: 1}
|
||
|
num1 = pushBack(num1, 3)
|
||
|
num1 = pushBack(num1, 2)
|
||
|
num1 = pushBack(num1, 4)
|
||
|
num1 = pushBack(num1, 5)
|
||
|
|
||
|
result := piscine.Reverse(num1)
|
||
|
for tmp := result; tmp != nil; tmp = tmp.Next {
|
||
|
fmt.Print(tmp.Num)
|
||
|
if tmp.Next != nil {
|
||
|
fmt.Print(" -> ")
|
||
|
}
|
||
|
}
|
||
|
fmt.Println()
|
||
5 years ago
|
}
|
||
|
```
|
||
|
|
||
|
Its output:
|
||
|
|
||
|
```console
|
||
5 years ago
|
student@ubuntu:~/[[ROOT]]/test$ go build
|
||
|
student@ubuntu:~/[[ROOT]]/test$ ./main
|
||
5 years ago
|
5 -> 4 -> 2 -> 3 -> 1
|
||
5 years ago
|
student@ubuntu:~/[[ROOT]]/test$
|
||
5 years ago
|
```
|