《Haskell函数式编程入门》练习

递归函数

1.Data.List中有一个函数为delete，它可以删除列表中的元素，即它的类型为delete::Eq a=>a->[a]->[a]。定义一个delete函数从列表中删去所有列表中出现的给定的元素。

例如：

> delete 2 [4,2,4,6,2]

[4,4,6]

2.请用与take类似的方法定义Prelude中的drop函数。

module Test (
	delete',
	drop'
	) 
where

delete' :: Eq a => a -> [a] -> [a]
delete' _ [] = []
delete' n (x:xs) = if n == x then delete' n xs else x : delete' n xs 

drop' :: Int -> [a] -> [a]
drop' _ [] = []
drop' n (_:xs) = drop' (n-1) xs

3.定义一个函数，将十进制转换为二进制，结果可以用只含有1与0的字符串来表示。

module Test (
	dec2bin
	) 
where

ls = "01"

dec2bin' :: Int -> String
dec2bin' n | n < 0 = error "not support yet!"
           | n == 0