随笔分类 -  算法

摘要：public class Demo{ public static void main(String[] args) { int [] arr = {5,6,1,4,3,2};// int [] arr = {5,1,4,2,3}; int count = 0; for (int i = arr.length -1 ; i > 0 ; i--) { int max = arr[0]; int position = 0; //找出最大值和所在位置 ... 阅读全文

摘要：public class Test{ public static void main(String[] args) { if(args.length != 3){ return; } int start = Integer.parseInt(args[0]); int end = Integer.parseInt(args[1]); int limit = Integer.parseInt(args[2]); //二维数组 int[][] r... 阅读全文