数组查找

superlyao · superlyao · commit ddf3fb917693 · 2017-11-02T21:32:31.000+08:00
diff --git a/src/com/blankj/easy/_002/Solution.java b/src/com/blankj/easy/_002/Solution.java
@@ -0,0 +1,21 @@
+package com.blankj.easy._002;
+
+/**
+ * Created by liaoyao on 2017/11/2.
+ */
+public class Solution {
+    public boolean Find(int target,int [][] array) {
+        int len = array.length-1;
+        int i = 0;
+        while((len >= 0)&& (i < array[0].length)){
+            if(array[len][i] > target){
+                len--;
+            }else if(array[len][i] < target){
+                i++;
+            }else{
+                return true;
+            }
+        }
+        return false;
+    }
+}
