java实现行程编码压缩.doc

import java.io.*;import java.util.HashSet;import java.util.Iterator;import java.util.Scanner;public class bianma1 public static void main(String args) FileReader reader=null;FileWriter writer=null;BufferedReader bin=null;BufferedWriter bout=null;Scanner scanner=null;HashSet set =new HashSet();File file=null;tryint count = new int300;reader=new FileReader(c:原始数据.txt);writer=new FileWriter(c:压缩文件.txt);bin=new BufferedReader(reader);bout=new BufferedWriter(writer);String s=null;file=new File(c:原始数据.txt);scanner=new Scanner(file);while(scanner.hasNext()set.add(Integer.parseInt(scanner.next();Iterator iterator=set.iterator();while(iterator.hasNext()int p=iterator.next();countp=1;System.out.println(压缩前的矩阵：);int d=1;while(s=bin.readLine()!=null)String a=s.split(D+);for(int i=0;ia.length;i+)System.out.print(ai+ );System.out.println(); for(int i=0;ia.length-1;i+)int w=0;int t=0;if(ai.equals()=false)int q=Integer.parseInt(ai);Iterator iterator1=set.iterator();if(ai.equals(ai+1)while(iterator1.hasNext()w=iterator1.next();if(q=w)t=w;countt+;if(i=a.length-2)bout.write(d+t+ai+t+(countt)+t+rn);countt=1;if(!ai.equals(ai+1)&i!=a.length-2)while(iterator1.hasNext()w=iterator1.next();if(q=w)t=w;countt+; bout.write(d+t+ai+t+(countt-1)+t+rn);countt=1;if(!ai.equals(ai+1)&i=a.length-2)while(iterator1.hasNext()w=iterator1.next();if(q=w)t=w;countt+;bout.write(d+t+ai+t+(countt-1)+t+rn+d+t+ai+1+t+1+t+rn);countt=1;else;d+;catch(IOException e)e.printStackTrace();finallytry bout.close();bin.close();reader.close();writer.close(); catch (Exception e2) e2.printStackTrace();try System.out.println(压缩后文件：);reader=new FileReader(c:压缩文件.txt);bin=new BufferedReader(reader);String s=null;while(s=bin.readLine()!=null)System.out.println(s); catch (Exception e) e.printSt