added new lines

willdoescode · willdoescode · commit 4e6f8fa1d10a · 2021-01-26T21:40:55.000-08:00
diff --git a/src/Easy/FizzBuzz.hs b/src/Easy/FizzBuzz.hs
@@ -7,4 +7,4 @@ fizzbuzz = map (\x -> case (x `rem` 5, x `rem` 3) of
                  (0, 0) -> "Fizzbuzz"
                  (0, _) -> "Fizz"
                  (_, 0) -> "Buzz"
-                 _ -> show x)
+                 _ -> show x)
diff --git a/src/Easy/NumOfStepsToReduceNumToZero.hs b/src/Easy/NumOfStepsToReduceNumToZero.hs
@@ -10,4 +10,4 @@ numOfStepsToReduceNumToZero' num count
   | num /= 0 = if even num
     then numOfStepsToReduceNumToZero' (num `div` 2) count + 1 
     else numOfStepsToReduceNumToZero' (num - 1) count + 1
-  | otherwise = count
+  | otherwise = count
diff --git a/src/Easy/RunningSum.hs b/src/Easy/RunningSum.hs
@@ -3,4 +3,4 @@ module RunningSum ( runningsum ) where
 -- https://leetcode.com/problems/running-sum-of-1d-array/
 
 runningsum :: [Integer] -> [Integer]
-runningsum = scanl1 (+)
+runningsum = scanl1 (+)
diff --git a/src/Easy/TargetArrayInGivenOrder.hs b/src/Easy/TargetArrayInGivenOrder.hs
@@ -10,4 +10,4 @@ targetArrayInGivenOrder' :: [(Int, Int)] -> [Int] -> [Int]
 targetArrayInGivenOrder' (h:t) l =
   targetArrayInGivenOrder' t (let (ys, xs) = splitAt (snd h) l in ys ++ [fst h] ++ xs)
 
-targetArrayInGivenOrder' [] x = x
+targetArrayInGivenOrder' [] x = x
