qq_41811552 2018-03-26 16:07 采纳率: 66.7%
浏览 770
已采纳

java代码用eclipse编译异常!

package test;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.TreeMap;

public class NumricRange {
public static void main(String... args) throws Exception {
int[] numrics = new int[1000];
File file = new File("range-file.txt");
PrintStream out = new PrintStream(file);
out.println("562 ~602 928 ~968 671 ~711 819 ~859 302 ~342 532 ~572 958 ~998");
out.println("453 ~493 671 ~711 193 ~233 931 ~971 54 ~94 349 ~389 775 ~815");
out.close();
FileInputStream fis = new FileInputStream(file);
InputStreamReader isr = new InputStreamReader(fis);
BufferedReader br = new BufferedReader(isr);
String line;
while ((line = br.readLine()) != null) {
String[] groups = line.split("[\t ]+(?!~)");
if (groups != null)
for (String group : groups) {
String[] ranges = group.split("[\t ]*~");
int min = Integer.parseInt(ranges[0]);
int max = Integer.parseInt(ranges[1]);
for (int i = min; i <= max; i++)
numrics[i]++;
}
}
Map> result = new TreeMap>();
int lastTimes = -1;
int[] lastResult = null;
for (int i = 0; i < 1000; i++) {
int time = numrics[i];
if (time == lastTimes)
lastResult[1] = i;
else if (time > -1) {
List list = result.get(time);
if (list == null) {
list = new ArrayList();
result.put(time, list);
}
list.add(lastResult = new int[] { i, i });
lastTimes=time;
}
}
Iterator>> it = result.entrySet().iterator();
while (it.hasNext()) {
Entry> entry = it.next();
int time = entry.getKey();
List list = entry.getValue();
System.out.println("出现" + time + "次的范围:");
for (int[] range : list) {
System.out.print(range[0] + "~" + range[1] + " ");
}
System.out.println();
}
}
}

  • 写回答

6条回答

  • 石洞镇 2018-03-26 16:33
    关注
     package test;
    
    import java.io.BufferedReader;
    import java.io.File;
    import java.io.FileInputStream;
    import java.io.InputStreamReader;
    import java.io.PrintStream;
    import java.util.ArrayList;
    import java.util.Iterator;
    import java.util.List;
    import java.util.Map;
    import java.util.Map.Entry;
    import java.util.TreeMap;
    
    public class NumricRange {
    
        public static void main(String[] args) throws Exception {
            int[] numrics = new int[1000];
            File file = new File("range-file.txt");
            PrintStream out = new PrintStream(file);
            out.println("562 ~602 928 ~968 671 ~711 819 ~859 302 ~342 532 ~572 958 ~998");
            out.println("453 ~493 671 ~711 193 ~233 931 ~971 54 ~94 349 ~389 775 ~815");
            out.close();
            FileInputStream fis = new FileInputStream(file);
            InputStreamReader isr = new InputStreamReader(fis);
            BufferedReader br = new BufferedReader(isr);
            String line;
            while ((line = br.readLine()) != null) {
                String[] groups = line.split("[\t ]+(?!~)");
                if (groups != null)
                    for (String group : groups) {
                        String[] ranges = group.split("[\t ]*~");
                        int min = Integer.parseInt(ranges[0]);
                        int max = Integer.parseInt(ranges[1]);
                        for (int i = min; i <= max; i++)
                            numrics[i]++;
                    }
            }
            TreeMap<Integer, List> result = new TreeMap<>();
            int lastTimes = -1;
            int[] lastResult = null;
            for (int i = 0; i < 1000; i++) {
                int time = numrics[i];
                if (time == lastTimes)
                    lastResult[1] = i;
                else if (time > -1) {
                    List list = result.get(time);
                    if (list == null) {
                        list = new ArrayList();
                        result.put(time, list);
                    }
                    list.add(lastResult = new int[] { i, i });
                    lastTimes = time;
                }
            }
            Iterator<Entry<Integer, List>> it = result.entrySet().iterator();
            while (it.hasNext()) {
                Entry<Integer, List> entry = it.next();
                int time = entry.getKey();
                List<int[]> list = entry.getValue();
                System.out.println("出现" + time + "次的范围:");
                for (int[] range : list) {
                    System.out.print(range[0] + "~" + range[1] + " ");
                }
                System.out.println();
            }
        }
    }
    
    
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(5条)

报告相同问题?

悬赏问题

  • ¥100 关于使用MATLAB中copularnd函数的问题
  • ¥20 在虚拟机的pycharm上
  • ¥15 jupyterthemes 设置完毕后没有效果
  • ¥15 matlab图像高斯低通滤波
  • ¥15 针对曲面部件的制孔路径规划,大家有什么思路吗
  • ¥15 钢筋实图交点识别,机器视觉代码
  • ¥15 如何在Linux系统中,但是在window系统上idea里面可以正常运行?(相关搜索:jar包)
  • ¥50 400g qsfp 光模块iphy方案
  • ¥15 两块ADC0804用proteus仿真时,出现异常
  • ¥15 关于风控系统,如何去选择