iritmaximus/haskell
1
0
Fork 0
mirror of https://github.com/iritmaximus/haskell.git synced 2026-10-12 19:13:39 +03:00
Code Issues Packages Projects Releases Wiki Activity

Set 4a Ex 5: reword, add challenge

Browse Source
This commit is contained in:
Joel Kaasinen
2021-06-19 22:17:14 +03:00
parent 580b512db0
commit a33c7cf377
1 changed files with 6 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
exercises/Set4a.hs
+6 -4
View File
@@ -82,14 +82,16 @@ rangeOf :: [a] -> a
rangeOf = todo rangeOf = todo
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
-- Ex 5: given a list of lists, return the longest list. If there -- Ex 5: given a (non-empty) list of (non-empty) lists, return the longest
-- are multiple lists of the same length, return the list that has -- list. If there are multiple lists of the same length, return the list that
-- the smallest _first element_. -- has the smallest _first element_.
-- --
-- (If multiple lists have the same length and same first element, -- (If multiple lists have the same length and same first element,
-- you can return any one of them.) -- you can return any one of them.)
-- --
-- Give the longest function a suitable type. -- Give the function "longest" a suitable type.
--
-- Challenge: Can you solve this exercise without sorting the list of lists?
-- --
-- Examples: -- Examples:
-- longest [[1,2,3],[4,5],[6]] ==> [1,2,3] -- longest [[1,2,3],[4,5],[6]] ==> [1,2,3]