lzm123456的博客

package Group1; //374. 猜数字大小 class GuessGame { private static final int NUM = 6; int guess(int num) { if (num == NUM) { return 0; } else if (num < NUM) { return -1; } return 1; } }

class Solution { public boolean searchMatrix(int[][] matrix, int target) { int m = matrix.length, n = matrix[0].length; int low = 0, high = m * n - 1; while (low <= high) { int mid = (high - low) / 2 + low; .

package Group9; public class Test8 { public static void main(String[] args) { int[] nums = {2,4,8,2}; int maxOperations = 2; Test8 test8=new Test8(); int i = test8.minimumSize(nums, maxOperations); System.out..

数组是非单调递增的 遍历nums1数组 对nums2进行二分查找 O（nlogn） package Group14; /** * @Description: TODO * @author: lzm * @date: 2021年05月09日 10:58 */ public class Test7 { public static void main(String[] args) { int[] nums1 = {55,30,5,4,2}, nums2 = {100,20,.