zoukankan      html  css  js  c++  java
  • JAVA的IO流下载音乐

    public class DownloadMusic {
        
        private static int count = 1;
    
        public static void main(String[] args) throws Exception {
            
            
            while(count < 16){
                String path = null;
                if(count < 10){
                    path = "http://mp3-cdn2.luoo.net/low/luoo/radio957/0"+count+".mp3";
                }else{
                    path = "http://mp3-cdn2.luoo.net/low/luoo/radio957/"+count+".mp3";
                }
                
                
                
                //获取URL对象
                URL url = new URL(path);
                //根据URL打开链接
                URLConnection connection = url.openConnection();
                
                //从连接处获取输入流对象
                InputStream inputStream = connection.getInputStream();
                
                System.out.println("链接成功!");
                
                File file = new File("E:/mp3/957");
                
                if(!file.exists()){
                    file.mkdirs();
                }
                
                if(count < 10){
                    IOUtils.download("E:/mp3/957/0"+count+".mp3", inputStream);
                }else{
                    IOUtils.download("E:/mp3/957/"+count+".mp3", inputStream);
                }
                
                
                count++;
            }
            
            
            
        }
    }
    

      

    import java.io.FileOutputStream;
    import java.io.InputStream;
    
    public class IOUtils {
        
        /**
         * 
         * @param path 需要下载的文件路径,包括后缀名
         * @param inStream 输入流
         */
        public static void download(String path,InputStream inStream){
            FileOutputStream fs;
            try {
                fs = new FileOutputStream(path);
                byte[] buffer = new byte[1204];
                
                int byteread = 0;
               
                while ((byteread = inStream.read(buffer)) != -1) {
                  fs.write(buffer, 0, byteread);
                }
                System.out.println(path + "保存成功!");
                
            } catch (Exception e) {
                e.printStackTrace();
            }
            
            
            
        }
    }
    

      

  • 相关阅读:
    24. Swap Nodes in Pairs(M);25. Reverse Nodes in k-Group(H)
    61. Rotate List(M);19. Remove Nth Node From End of List(M)
    素数筛选法(prime seive)
    哈夫曼树;二叉树;二叉排序树(BST)
    sort与qsort的区别与联系
    贪心算法
    First non-repeating character in a stream
    transform
    C++11 & C++14 & C++17新特性
    开个玩笑
  • 原文地址:https://www.cnblogs.com/qinyios/p/10403877.html
Copyright © 2011-2022 走看看