forked from root/public
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.
61 lines
968 B
61 lines
968 B
5 years ago
|
## changeorder
|
||
|
|
||
|
### Instructions
|
||
|
|
||
|
You are given a linked list, where each node contains a single digit.
|
||
![]()
4 years ago
|
Change order of linked list so that elements with odd index come first, elements with even index come afterwards.
|
||
5 years ago
|
You have to return pointer/reference to the beginning of new 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 Changeorder(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: 1}
|
||
|
num1 = pushBack(num1, 2)
|
||
|
num1 = pushBack(num1, 3)
|
||
|
num1 = pushBack(num1, 4)
|
||
|
num1 = pushBack(num1, 5)
|
||
|
|
||
|
result := Changeorder(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
|
$ go build
|
||
|
$ ./main
|
||
5 years ago
|
1 -> 3 -> 5 -> 2 -> 4
|
||
|
```
|