xiaohanguo_xiao的博客

堆排序的构建和排序，分别构建大顶和小顶堆，然后排序 public class Jsoup { public static void main(String[] args) { int[] arr = {4, 6, 8, 5, 9,7,13}; sortHeap(arr); } public static void sortHeap(int[] arr) { //先构建出大顶堆出来 for (int i =

如题 链接地址：找工作前仔细查看，可以避免很多的坑，兄弟们大家互相关照。搬砖不易

public class Mytest { public static void main(String[] args) { int[] arr = {-9, -4, 6, 10, 20, 1000}; search(arr,30); } public static void search(int []a,int findValu...

public class Mytest { public static void main(String[] args) { int[] arr = {-9, -4, 6, 10, 20, 1000}; binarySearch(arr, 0, arr.length - 1, -10000); System.out.println(Arra...

public class Mytest{ public static void main(String[]args){ int []arr={9,-4,6,-100,20,10,-1000}; shellSort(arr); System.out.println(Arrays.toString(arr)); } publ...

public class Mytest{ public static void main(String[]args){ int []arr={9,-4,6,-100}; insertSort(arr); System.out.println(Arrays.toString(arr)); } public static v...

public class Mytest { public static int count=0; public static void main(String[] args) { int arr[]={-2,9,6,-8}; selectSort(arr); System.out.println(Arrays.toString(a...

class Solution { public int threeSumClosest(int[] nums, int target) { Arrays.sort(nums); int temp; int min=Integer.MAX_VALUE; int result; int ii = 0,jj=0,kk=0; for(int i=0;i<...

class Solution { public int arrayPairSum(int[] nums) { Arrays.sort(nums); int max=0; for(int i=0;i<nums.length-1;i+=2){ max+=Math.min(nums[i],nums[i+1]) ; ...