|
|
|
## reverse
|
|
|
|
|
|
|
|
### 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
|
|
|
|
|
|
|
|
### Expected function and structure
|
|
|
|
|
|
|
|
```go
|
|
|
|
package main
|
|
|
|
|
|
|
|
type NodeAddL struct {
|
|
|
|
Next *NodeAddL
|
|
|
|
Num int
|
|
|
|
}
|
|
|
|
|
|
|
|
func Reverse(node *NodeAddL) *NodeAddL {
|
|
|
|
|
|
|
|
}
|
|
|
|
```
|
|
|
|
|
|
|
|
### Usage
|
|
|
|
|
|
|
|
Here is a possible program to test your function :
|
|
|
|
|
|
|
|
```go
|
|
|
|
package main
|
|
|
|
|
Refactor & Beautify & destruction commit
return early, remove else branches, reorder conditions and top-level functions, remove empty lines, remove unnecessary append(), fix typos, stop using testing package, remove dead code, fix mistakes in subjects, tests and solutions, remove disclaimers, reformat comments, simplify solutions, tests, add more instructions to subjects, remove obsolete files, etc.
Some of the reasons behind those modifications will be added to good-practices.en.md
Some of the exercises are now broken, they will have to be fixed, most of them have a "TODO:" comment.
5 years ago
|
|
|
import "fmt"
|
|
|
|
|
|
|
|
func pushBack(n *NodeAddL, num int) *NodeAddL{
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
func main() {
|
|
|
|
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()
|
|
|
|
}
|
|
|
|
```
|
|
|
|
|
|
|
|
Its output:
|
|
|
|
|
|
|
|
```console
|
|
|
|
student@ubuntu:~/reverse/test$ go build
|
|
|
|
student@ubuntu:~/reverse/test$ ./main
|
|
|
|
5 -> 4 -> 2 -> 3 -> 1
|
|
|
|
student@ubuntu:~/reverse/test$
|
|
|
|
```
|