Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
Thank you ❤.. i was looking for that for a week
Excellent lecture.
thank you
very well explained
type coin = Head | Tail;;let rec sum x = match x with []-> 0 | Head::t-> 1 + sum t | Tail::t-> -1 + sum t;; (* now OCaml tells you if you have more Heads or Tails *)
let sum_coins = List.fold_left (fun acc coin -> match coin with Head -> acc + 1 | Tail -> acc - 1) 0
Thank you ❤.. i was looking for that for a week
Excellent lecture.
thank you
very well explained
type coin = Head | Tail;;
let rec sum x =
match x with
[]-> 0
| Head::t-> 1 + sum t
| Tail::t-> -1 + sum t
;; (* now OCaml tells you if you have more Heads or Tails *)
let sum_coins =
List.fold_left (fun acc coin -> match coin with Head -> acc + 1 | Tail -> acc - 1) 0