Browse Source

Merge pull request #461 from 01-edu/struct-confict

subject fix
pull/465/head
OGordoo 5 years ago committed by GitHub
parent
commit
dac26a1b8b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
  1. 3
      subjects/addlinkednumbers.en.md
  2. 4
      subjects/changeorder.en.md
  3. 20
      subjects/inverttree.en.md
  4. 1
      subjects/merge.en.md
  5. 1
      subjects/reverse.en.md

3
subjects/addlinkednumbers.en.md

@ -44,8 +44,7 @@ import (
) )
func pushFront(node *NodeAddL, num int) *NodeAddL { func pushFront(node *NodeAddL, num int) *NodeAddL {
// ...
// Write yourself
} }
func main() { func main() {

4
subjects/changeorder.en.md

@ -68,7 +68,7 @@ func main() {
Its output: Its output:
```console ```console
$> go build $ go build
$> ./main $ ./main
1 -> 3 -> 5 -> 2 -> 4 1 -> 3 -> 5 -> 2 -> 4
``` ```

20
subjects/inverttree.en.md

@ -11,18 +11,27 @@ This means that:
- The function main declared needs to **also pass** the `Restrictions Checker`(illegal functions tester). It is advised for the student to just empty the function main after its own testings are done. - The function main declared needs to **also pass** the `Restrictions Checker`(illegal functions tester). It is advised for the student to just empty the function main after its own testings are done.
- Every other rules are obviously the same than for a `program`. - Every other rules are obviously the same than for a `program`.
### Instructions
### Instructions:
Write a function that takes tree and inverts(flips) and returns it. Write a function that takes tree and inverts(flips) and returns it.
```
### Expected function and structure
```go
type TNode struct { type TNode struct {
Val int Val int
Left *TNode Left *TNode
Right *TNode Right *TNode
} }
func InvertTree(root *TNode) *TNode {
}
``` ```
Example: Example:
```
```shell
Input: Input:
7 7
/ \ / \
@ -37,8 +46,3 @@ Output:
/ \ / \ / \ / \
13 9 6 3 13 9 6 3
``` ```
Expected function:
```
func InvertTree(root *TNode) *TNode {
}
```

1
subjects/merge.en.md

@ -66,7 +66,6 @@ Here is a possible program to test your function :
```go ```go
package main package main
func main() { func main() {
mergedTree := &TreeNodeM{} mergedTree := &TreeNodeM{}
t1 := NewRandTree() t1 := NewRandTree()

1
subjects/reverse.en.md

@ -62,7 +62,6 @@ func main() {
} }
fmt.Println() fmt.Println()
} }
``` ```
Its output: Its output:

Loading…
Cancel
Save