Question

一道关于java排序算法的题目（蓝桥杯编程题）

public class Main { List<Integer> list = new ArrayList<Integer>(); int duan = 0 ; int re = 0 ; public void wang(){ Scanner scan1 = new Scanner(System.in); Scanner scan = new Scanner(new BufferedInputStream(System.in)); int count = scan1.nextInt(); for(int i = 0 ; i < count ;i++){ String s = scan.nextLine().trim() ; String[] nums = s.split("\\s+"); for(String num : nums){

Answer 1

import java.io.BufferedInputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class Main
{

int re = 0;

public String doFilter()
{
//在这里我把断号和重号的初始值都设置成0，实际情况是不可能出现0的情况，所以设置成0.
int m = 0;// 表示断号
int n = 0;// 表示重号
List<String[]> list = new ArrayList<String[]>();
List<Integer> numList = new ArrayList<Integer>();
Scanner scan1 = new Scanner(System.in);
Scanner scan2 = new Scanner(new BufferedInputStream(System.in));
int rowNum = scan1.nextInt();
// 把输入所有行的数据放到numList里
for (int i = 0; i < rowNum; i++)
{
String s = scan2.nextLine().trim();
String[] nums = s.split(" ");
for (String str : nums)
{
if (str.trim().length() != 0)
{
numList.add(Integer.valueOf(str));
}
}
}
// 使用工具类对numList进行排序
Collections.sort(numList, new Comparator<Integer>()
{
@Override
public int compare(Integer a, Integer b)
{
if (a > b)
{
return 1;
}
return -1;
}
});

for (int i = 0; i < numList.size() - 1; i++)
{
//得到断号
if (numList.get(i) == numList.get(i + 1))
{
n = numList.get(i);
continue;
}
//得到重号
if ((numList.get(i) + 1) != numList.get(i + 1))
{
m = numList.get(i) + 1;
}

}

return m + " " + n;
}

public static void main(String[] args)
{
//测试下
System.out.println(new Main().doFilter());
}
}