Daniel丶

快速排序public class Main{ static int[] arr = {100,99,88,66,55,77,11,22}; public static void main(String args[]) { //将数组的首尾数传进去 quickSort(0,arr.length-1); for(int i=0;i<arr.length;i++) { ...

//递归小训练public class Main{ //从 0-n public static void f(int n) { if(n>0) f(n-1); System.out.println(n); } //从begin 到 end public static void f2(int begin,int end) { if(end>begin) f2(...

import java.util.LinkedList;import java.util.Scanner;public class Main { static int k,ans=10000; static int count[]; public static void main(String[] args) { Scanner sc = new Scanner(System.in...

public class Main{ public static void main(String[] args) { String s1 = "abcd"; String s2 = "eabcdf"; int n = f(s1,s2); System.out.println(n); } private static int f(String s1, String s2) ...

import java.util.ArrayList;public class Test8 { /** * @param args * 约瑟夫环 * * 幸运数字 */ public static void main(String[] args) { System.out.println(getLucklyNum(8)); } /* * 获取幸运数字 *...