SHOW:
|
|
- or go back to the newest paste.
| 1 | let a = [ [1] ; [2;8;9] ; [3] ; [4] ; [5;10] ; [6] ; [7] ] | |
| 2 | - | let rec del = fun N -> |
| 2 | + | let rec del N = |
| 3 | - | if N == 1 then del(List.tail 0) |
| 3 | + | if N == 1 then del(a.Tail 0) |
| 4 | else | |
| 5 | - | List.head :: del(List.tail 1) |
| 5 | + | a.Head :: del(a.Tail 1) |
