Talk:99 questions/1 to 10
From HaskellWiki
(Difference between revisions)
| Line 4: | Line 4: | ||
[[User:Chrycheng|Chrycheng]] 12:02, 12 September 2007 (UTC) | [[User:Chrycheng|Chrycheng]] 12:02, 12 September 2007 (UTC) | ||
| + | |||
| + | I think the answer to problem 6 is kind of "cheating". I think something like this would be a nice alternate solutions: | ||
| + | |||
| + | <haskell> | ||
| + | isPalindrome :: Eq (a) => [a] -> Bool | ||
| + | isPalindrome [] = True | ||
| + | isPalindrome [x] = True | ||
| + | isPalindrome (x:xs) = x == last xs && isPalindrome (init xs) | ||
| + | </haskell> | ||
| + | |||
| + | [[User:Michael|Michael]] 16:40, 17 January 2008 (UTC) | ||
Revision as of 16:40, 17 January 2008
Does the problem 1 example need correction?
The problem refers us tolast
Prelude
last
[a] -> a
[a] -> [a]
last
Chrycheng 12:02, 12 September 2007 (UTC)
I think the answer to problem 6 is kind of "cheating". I think something like this would be a nice alternate solutions:
isPalindrome :: Eq (a) => [a] -> Bool isPalindrome [] = True isPalindrome [x] = True isPalindrome (x:xs) = x == last xs && isPalindrome (init xs)
Michael 16:40, 17 January 2008 (UTC)
