qq_34519470的博客

/** * 不使用递归的二分查找 *title:commonBinarySearch *@param arr *@param key *@return 关键字位置 */ public static int commonBinarySearch(int[] arr,int key){ int low = 0; int high = arr.length - 1; int middle = 0; //定义middle if(key < arr[low].

就是搞成矩阵的样子package leetcode;import java.util.ArrayList;import java.util.List;public class demo40 { public static void main(String[] args) {// List<String> a=new ArrayList<>();// a.add("你好");// a.add("你换");//

package leetcode;public class demo31 { public int findRepeatNumber(int[] nums) {//设索引初始值为 i = 0 int i = 0; //遍历整个数组 nums while(i < nums.length) { //索引 i 的值为 i,无需执行交换操作，查看下一位 if(nums[i] == i) {

package leetcode;import java.util.Arrays;public class demo30 { public void merge(int[] nums1, int m, int[] nums2, int n) { //源码：public static native void // arraycopy(Object src, int srcPos, Object dest, int destPos,int length);

package leetcode;public class demo19 { public static int[] twoSum(int[] nums, int target) { for (int i=0;i<nums.length;i++) for (int j=i+1;j<nums.length;j++){ if (nums[i]+nums[j]==target){ return