zoukankan      html  css  js  c++  java
  • java基础之I/O操作

    字节流

    直接上代码:

    import java.io.*;
    
    class Test{
        public static void main(String[] args){
            FileInputStream inputfile = null;
            FileOutputStream outputfile = null;
            try{
                inputfile = new FileInputStream("./input.txt");
                outputfile = new FileOutputStream("./output.txt");
                byte[] buffer = new byte[100];
                int temp = inputfile.read(buffer,0,buffer.length);
                String s = new String(buffer);
                s = s.trim();
                System.out.println(s);
                outputfile.write(buffer,0,temp);
                
            }
            catch(Exception e){
                System.out.println(e);
            }
            
        }
    }

    优化版:

    通过循环1M 1M读取文件

    import java.io.*;
    
    class Test{
        public static void main(String[] args){
            FileInputStream inputfile = null;
            FileOutputStream outputfile = null;
            try{
                inputfile = new FileInputStream("./input.txt");
                outputfile = new FileOutputStream("./output.txt");
                byte[] buffer = new byte[1024];
                while(true){
                    int temp = inputfile.read(buffer,0,buffer.length);
                    if(temp == -1){
                        break;
                    }
                    outputfile.write(buffer,0,temp);
                    
                }
                
                
            }
            catch(Exception e){
                System.out.println(e);
            }
            finally{
                try{
                    inputfile.close();
                    outputfile.close();
                }
                catch(Exception e){
                    System.out.println(e);    
                }
                
            }
            
        }
    }

    字符流

    import java.io.*;
    
    class TestString{
        public static void main(String[] args){
            FileReader inputfile = null;
            FileWriter outputfile = null;
            try{
                inputfile = new FileReader("./input.txt");
                outputfile = new FileWriter("./output.txt");
                char[] buffer = new char[1024];
                while(true){
                    int temp = inputfile.read(buffer,0,buffer.length);
                    if(temp == -1){
                        break;
                    }
                    outputfile.write(buffer,0,temp);
                    
                }
                
                
            }
            catch(Exception e){
                System.out.println(e);
            }
            finally{
                try{
                    inputfile.close();
                    outputfile.close();
                }
                catch(Exception e){
                    System.out.println(e);    
                }
                
            }
            
        }
    }

     BufferedReader.readLine

    import java.io.*;
    
    class TestBufferReader{
        public static void main(String[] args){
            FileReader fileReader = null;
            BufferedReader bufferReader = null;
            try{
                fileReader = new FileReader("./input.txt");
                bufferReader = new BufferedReader(fileReader);
                String line =null;
                while(true){
                    line = bufferReader.readLine();
                    if(line == null){
                        break;
                    }
                    System.out.println(line);
                }
            }
            catch(Exception e){
                System.out.println(e);
            }
            
        }
    }

  • 相关阅读:
    树套树+【UVALive】6709 Mosaic 二维线段树
    汇编实验1. 计算1+2+3+…+10,将结果显示在屏幕上。4
    Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2) D. Destruction of a Tree
    HDU 4417 Super Mario主席树
    spoj+B
    2018-2019赛季多校联合新生训练赛第五场(2018/12/14)补题题解
    迷宫问题 POJ
    浅谈二分搜索与二分查找
    Moving Tables POJ
    Humidex POJ
  • 原文地址:https://www.cnblogs.com/endust/p/11846040.html
Copyright © 2011-2022 走看看