这是我正式刷题的第一道题，很有纪念意义啊！2022/5/30 8:30 美好的开始❤️加油！

https://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e

暴力求解

自己想出来的。

  1. public static boolean Find(int target, int[][] array) {
  2.     for (int i = 0; i < array.length; i++) {
  3.         for (int j = 0; j < array[i].length; j++) {
  4.             if (target == array[i][j])
  5.             return true;
  6.         }
  7.     }
  8.     return false;
  9. }

二分查找

看了别人的思路，自己做出来了哈哈👍
image.png

  1. public class Solution {
  2.     public boolean Find(int target, int [][] array) {
  3.         //每轮用二分查找
  4.         for (int i = 0; i < array.length; i++) {
  5.             boolean ans = binarySearch(target, array[i]);
  6.             if (ans)
  7.                 return ans;
  8.         }
  9.         return false;
  10.     }
  12.      public static boolean binarySearch(int target, int[] array) {
  13.         //二分查找算法
  14.         int left = 0, right = array.length - 1, mid = (left + right) / 2;
  15. //        System.out.println(left);
  16. //        System.out.println(right);
  17. //        System.out.println(mid);
  18.         while (right >= left) {
  19.             if (array[mid] == target) {
  20. //                System.out.println("index:" + mid);
  21.                 return true;
  22.             } else if (array[mid] > target) {
  23.                 right = mid - 1;
  24.                 mid = (left + right) / 2;
  25.             } else {
  26.                 left = mid + 1;
  27.                 mid = (left + right) / 2;
  28.             }
  29.         }
  30.         return false;
  31.     }
  32. }