Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings
This repository was archived by the owner on Jul 24, 2023. It is now read-only.

Commit 6f84f97

Browse files
author
cd155
committed
add test case
1 parent b3f39e5 commit 6f84f97

File tree

1 file changed

+3
-0
lines changed

1 file changed

+3
-0
lines changed

‎src/BinarySearch.hs

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -251,6 +251,9 @@ genNum xs = genNumHelper (setListBits xs initalBit) 0
251251
Given an M x N matrix in which each row and
252252
each column is sorted in ascending order,
253253
write a method to find an element.
254+
255+
test case: sortedMatrixSearch 110 matrixArray
256+
expect: (2,2)
254257
-}
255258
sortedMatrixSearch :: Ord a => a -> [[a]] -> (Nat, Nat)
256259
sortedMatrixSearch t xs =

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /