search_a_2D_matrix_II

hitzzc · hitzzc · commit cd90839bd0db · 2016-10-19T14:19:59.000+08:00
diff --git a/README.md b/README.md
@@ -195,6 +195,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [237. Delete Node in a Linked List](https://github.com/hitzzc/go-leetcode/tree/master/delete_node_in_a_linked_list)
 #### [238. product of array except self](https://github.com/hitzzc/go-leetcode/tree/master/product_of_array_except_self)
 #### [239. Sliding Window Maximum](https://github.com/hitzzc/go-leetcode/tree/master/sliding_window_maximum)
+#### [240. Search a 2D Matrix II](https://github.com/hitzzc/go-leetcode/tree/master/search_a_2D_matrix_II)
 
 
 
diff --git a/search_a_2D_matrix_II/search_a_2D_matrix_II.go b/search_a_2D_matrix_II/search_a_2D_matrix_II.go
@@ -0,0 +1,20 @@
+package search_a_2D_matrix_II
+
+func searchMatrix(matrix [][]int, target int) bool {
+	if len(matrix) == 0 || len(matrix[0]) == 0 {
+		return false
+	}
+	row, col := 0, len(matrix[0])-1
+	for row <= len(matrix)-1 && col >= 0 {
+		if matrix[row][col] == target {
+			return true
+		}
+		for row <= len(matrix)-1 && matrix[row][col] < target {
+			row++
+		}
+		for col >= 0 && matrix[row][col] > target {
+			col--
+		}
+	}
+	return false
+}
