調了一晚上……
data Tree=Tree Int Int [Tree] [Tree]|Empty deriving (Show)
build :: (Int,Int)->Treebuild (x,y)=if x<y then Tree x y [build (x,(div (x+y) 2))] [build ((div (x+y) 2)+1,y)] else Tree x y [Empty] [Empty]
Haskell線段樹建樹
build (x,y)=if x<y then Tree x y [build (x,(div (x+y) 2))] [build ((div (x+y) 2)+1,y)] else Tree x y [Empty] [Empty]
發表評論
所有評論
還沒有人評論，想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章
A Road Map for Deep Learning
點這個： https://towardsdatascience.com/a-road-map-for-deep-learning-b9aee0b2919f