// Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

// Integers in each row are sorted from left to right.
// The first integer of each row is greater than the last integer of the previous row.
// For example,

// Consider the following matrix:

// [
//   [1,   3,  5,  7],
//   [10, 11, 16, 20],
//   [23, 30, 34, 50]
// ]

// Given target = 3, return true.

@@ -421,8 +421,93 @@
 n true.%0A
+%0A/**%0A * @param %7Barray%5B%5D%5B%5D%7D matrix%0A * @param %7Bnumber%7D target%0A * @return %7Bboolean%7D%0A */%0A

add params