forked from root/public
52 changed files with 862 additions and 652 deletions
@ -1,44 +1,59 @@
|
||||
## countif |
||||
## listpushback |
||||
|
||||
### Instructions |
||||
|
||||
Écrire une fonction `CountIf` qui retournes le nombre d'éléments d'un tableau de `string` pour lesquels la fonction `f` retourne `true`. |
||||
Write a function `ListLast` that returns the last element of the linked list. |
||||
|
||||
### Fonction attendue |
||||
### Expected function and structure |
||||
|
||||
```go |
||||
func CountIf(f func(string) bool, tab []string) int { |
||||
type Node struct { |
||||
Data interface{} |
||||
Next *Node |
||||
} |
||||
|
||||
type List struct { |
||||
Head *Node |
||||
Tail *Node |
||||
} |
||||
|
||||
func ListLast(l *List) interface{} { |
||||
} |
||||
``` |
||||
|
||||
### Utilisation |
||||
### Usage |
||||
|
||||
Voici un éventuel [programme](TODO-LINK) pour tester votre fonction : |
||||
Here is a possible [program](TODO-LINK) to test your function : |
||||
|
||||
```go |
||||
package main |
||||
|
||||
import ( |
||||
"fmt" |
||||
|
||||
piscine ".." |
||||
) |
||||
|
||||
func main() { |
||||
tab1 := []string{"Hello", "how", "are", "you"} |
||||
tab2 := []string{"This","1", "is", "4", "you"} |
||||
answer1 := piscine.CountIf(piscine.IsNumeric, tab1) |
||||
answer2 := piscine.CountIf(piscine.IsNumeric, tab2) |
||||
fmt.Println(answer1) |
||||
fmt.Println(answer2) |
||||
link := &piscine.List{} |
||||
link2 := &piscine.List{} |
||||
|
||||
piscine.ListPushBack(link, "three") |
||||
piscine.ListPushBack(link, 3) |
||||
piscine.ListPushBack(link, "1") |
||||
|
||||
fmt.Println(piscine.ListLast(link)) |
||||
fmt.Println(piscine.ListLast(link2)) |
||||
} |
||||
|
||||
``` |
||||
|
||||
Et son résultat : |
||||
And its output : |
||||
|
||||
```console |
||||
student@ubuntu:~/piscine/test$ go build |
||||
student@ubuntu:~/piscine/test$ ./test |
||||
0 |
||||
2 |
||||
1 |
||||
<nil> |
||||
student@ubuntu:~/piscine/test$ |
||||
``` |
||||
|
||||
@ -1,44 +1,83 @@
|
||||
## countif |
||||
## listpushback |
||||
|
||||
### Instructions |
||||
|
||||
Écrire une fonction `CountIf` qui retournes le nombre d'éléments d'un tableau de `string` pour lesquels la fonction `f` retourne `true`. |
||||
Write a function `ListSort` that sorts the linked list by ascending order. |
||||
|
||||
### Fonction attendue |
||||
- This time you only will have the `node` structure. |
||||
|
||||
- Try to use recursive. |
||||
|
||||
- Use pointers when ever you can. |
||||
|
||||
### Expected function and structure |
||||
|
||||
```go |
||||
func CountIf(f func(string) bool, tab []string) int { |
||||
type NodeI struct { |
||||
Data int |
||||
Next *NodeI |
||||
} |
||||
|
||||
func ListSort(l *NodeI) *NodeI { |
||||
|
||||
} |
||||
``` |
||||
|
||||
### Utilisation |
||||
### Usage |
||||
|
||||
Voici un éventuel [programme](TODO-LINK) pour tester votre fonction : |
||||
Here is a possible [program](TODO-LINK) to test your function : |
||||
|
||||
```go |
||||
package main |
||||
|
||||
import ( |
||||
"fmt" |
||||
|
||||
piscine ".." |
||||
) |
||||
|
||||
func PrintList(l *piscine.NodeI) { |
||||
m := l |
||||
for m != nil { |
||||
fmt.Print(m.Data, " -> ") |
||||
m = m.Next |
||||
} |
||||
fmt.Print(nil) |
||||
fmt.Println() |
||||
} |
||||
|
||||
func listPushBack(l *piscine.NodeI, data int) *piscine.NodeI { |
||||
n := &piscine.NodeI{Data: data} |
||||
|
||||
if l == nil { |
||||
return n |
||||
} |
||||
iterator := l |
||||
for iterator.Next != nil { |
||||
iterator = iterator.Next |
||||
} |
||||
iterator.Next = n |
||||
return l |
||||
} |
||||
|
||||
func main() { |
||||
tab1 := []string{"Hello", "how", "are", "you"} |
||||
tab2 := []string{"This","1", "is", "4", "you"} |
||||
answer1 := piscine.CountIf(piscine.IsNumeric, tab1) |
||||
answer2 := piscine.CountIf(piscine.IsNumeric, tab2) |
||||
fmt.Println(answer1) |
||||
fmt.Println(answer2) |
||||
var link *piscine.NodeI |
||||
|
||||
link = listPushBack(link, 5) |
||||
link = listPushBack(link, 4) |
||||
link = listPushBack(link, 3) |
||||
link = listPushBack(link, 2) |
||||
link = listPushBack(link, 1) |
||||
|
||||
PrintList(piscine.ListSort(link)) |
||||
} |
||||
``` |
||||
|
||||
Et son résultat : |
||||
And its output : |
||||
|
||||
```console |
||||
student@ubuntu:~/piscine/test$ go build |
||||
student@ubuntu:~/piscine/test$ ./test |
||||
0 |
||||
2 |
||||
1 -> 2 -> 3 -> 4 -> 5 -> <nil> |
||||
student@ubuntu:~/piscine/test$ |
||||
``` |
||||
|
||||
@ -1,44 +1,82 @@
|
||||
## countif |
||||
## sortedlistmerge |
||||
|
||||
### Instructions |
||||
|
||||
Écrire une fonction `CountIf` qui retournes le nombre d'éléments d'un tableau de `string` pour lesquels la fonction `f` retourne `true`. |
||||
Write a function `SortedListMerge` that mereges two lists, `n1` and `n2`, but it as to join them in ascending order. |
||||
|
||||
### Fonction attendue |
||||
- Tip each list as to be already sorted. |
||||
|
||||
- Use pointers when ever you can. |
||||
|
||||
### Expected function and structure |
||||
|
||||
```go |
||||
func CountIf(f func(string) bool, tab []string) int { |
||||
func SortedListMerge(n1 *NodeI, n2 *NodeI) *NodeI { |
||||
|
||||
} |
||||
``` |
||||
|
||||
### Utilisation |
||||
### Usage |
||||
|
||||
Voici un éventuel [programme](TODO-LINK) pour tester votre fonction : |
||||
Here is a possible [program](TODO-LINK) to test your function : |
||||
|
||||
```go |
||||
package main |
||||
|
||||
import ( |
||||
"fmt" |
||||
|
||||
piscine ".." |
||||
) |
||||
|
||||
type node = piscine.NodeI |
||||
type nodes = piscine.NodeI |
||||
|
||||
func PrintList(l *piscine.NodeI) { |
||||
m := l |
||||
for m != nil { |
||||
fmt.Print(m.Data, " -> ") |
||||
m = m.Next |
||||
} |
||||
fmt.Print(nil) |
||||
fmt.Println() |
||||
} |
||||
|
||||
func listPushBack(l *piscine.NodeI, data int) *piscine.NodeI { |
||||
n := &piscine.NodeI{Data: data} |
||||
|
||||
if l == nil { |
||||
return n |
||||
} |
||||
iterator := l |
||||
for iterator.Next != nil { |
||||
iterator = iterator.Next |
||||
} |
||||
iterator.Next = n |
||||
return l |
||||
} |
||||
|
||||
func main() { |
||||
tab1 := []string{"Hello", "how", "are", "you"} |
||||
tab2 := []string{"This","1", "is", "4", "you"} |
||||
answer1 := piscine.CountIf(piscine.IsNumeric, tab1) |
||||
answer2 := piscine.CountIf(piscine.IsNumeric, tab2) |
||||
fmt.Println(answer1) |
||||
fmt.Println(answer2) |
||||
var link *node |
||||
var link2 *nodes |
||||
|
||||
link = listPushBack(link, 5) |
||||
link = listPushBack(link, 3) |
||||
link = listPushBack(link, 7) |
||||
|
||||
link2 = listPushBack(link2, -2) |
||||
link2 = listPushBack(link2, 4) |
||||
|
||||
PrintList(piscine.SortedListMerge(link2, link)) |
||||
} |
||||
|
||||
``` |
||||
|
||||
Et son résultat : |
||||
And its output : |
||||
|
||||
```console |
||||
student@ubuntu:~/piscine/test$ go build |
||||
student@ubuntu:~/piscine/test$ ./test |
||||
0 |
||||
2 |
||||
-2 -> 3 -> 4 -> 5 -> 7 -> <nil> |
||||
student@ubuntu:~/piscine/test$ |
||||
``` |
||||
|
||||
@ -1,4 +1,4 @@
|
||||
## sortList |
||||
## sortlist |
||||
|
||||
### Instructions |
||||
|
||||
@ -1,44 +1,80 @@
|
||||
## countif |
||||
## sortlistinsert |
||||
|
||||
### Instructions |
||||
|
||||
Écrire une fonction `CountIf` qui retournes le nombre d'éléments d'un tableau de `string` pour lesquels la fonction `f` retourne `true`. |
||||
Write a function `SortListInsert` that inserts `data_ref` in the linked list, but it as to remain sorted in ascending order. |
||||
|
||||
### Fonction attendue |
||||
- The list as to be alredy sorted. |
||||
|
||||
- Use pointers when ever you can. |
||||
|
||||
### Expected function and structure |
||||
|
||||
```go |
||||
func CountIf(f func(string) bool, tab []string) int { |
||||
func SortListInsert(l *NodeI, data_ref int) *NodeI{ |
||||
|
||||
} |
||||
``` |
||||
|
||||
### Utilisation |
||||
### Usage |
||||
|
||||
Voici un éventuel [programme](TODO-LINK) pour tester votre fonction : |
||||
Here is a possible [program](TODO-LINK) to test your function : |
||||
|
||||
```go |
||||
package main |
||||
|
||||
import ( |
||||
"fmt" |
||||
|
||||
piscine ".." |
||||
) |
||||
|
||||
func PrintList(l *piscine.NodeI) { |
||||
m := l |
||||
for m != nil { |
||||
fmt.Print(m.Data, " -> ") |
||||
m = m.Next |
||||
} |
||||
fmt.Print(nil) |
||||
fmt.Println() |
||||
} |
||||
|
||||
func listPushBack(l *piscine.NodeI, data int) *piscine.NodeI { |
||||
n := &piscine.NodeI{Data: data} |
||||
|
||||
if l == nil { |
||||
return n |
||||
} |
||||
iterator := l |
||||
for iterator.Next != nil { |
||||
iterator = iterator.Next |
||||
} |
||||
iterator.Next = n |
||||
return l |
||||
} |
||||
|
||||
func main() { |
||||
tab1 := []string{"Hello", "how", "are", "you"} |
||||
tab2 := []string{"This","1", "is", "4", "you"} |
||||
answer1 := piscine.CountIf(piscine.IsNumeric, tab1) |
||||
answer2 := piscine.CountIf(piscine.IsNumeric, tab2) |
||||
fmt.Println(answer1) |
||||
fmt.Println(answer2) |
||||
|
||||
var link *piscine.NodeI |
||||
|
||||
link = listPushBack(link, 1) |
||||
link = listPushBack(link, 4) |
||||
link = listPushBack(link, 9) |
||||
|
||||
PrintList(link) |
||||
|
||||
link = piscine.SortListInsert(link, -2) |
||||
link = piscine.SortListInsert(link, 2) |
||||
PrintList(link) |
||||
} |
||||
``` |
||||
|
||||
Et son résultat : |
||||
And its output : |
||||
|
||||
```console |
||||
student@ubuntu:~/piscine/test$ go build |
||||
student@ubuntu:~/piscine/test$ ./test |
||||
0 |
||||
2 |
||||
1 -> 4 -> 9 -> <nil> |
||||
-2 -> 1 -> 2 -> 4 -> 9 -> <nil> |
||||
student@ubuntu:~/piscine/test$ |
||||
``` |
||||
|
||||
Loading…
Reference in new issue