zoukankan      html  css  js  c++  java
  • java中文乱码解决方法汇总

    publicstaticvoidmain(String[]argv){

    try{
        
               System.out.println(“中文”);//1
     
               System.out.println(“中文”.getBytes());//2
     
               System.out.println(“中文”.getBytes(GB2312));//3
     
               System.out.println(“中文”.getBytes(ISO8859_1″));//4
              
     
               System.out.println(newString(“中文”.getBytes()));//5
     
               System.out.println(newString(“中文”.getBytes(),GB2312));//6
     
               System.out.println(newString(“中文”.getBytes(),ISO8859_1″));//7
     
               System.out.println(newString(“中文”.getBytes(GB2312)));//8
     
               System.out.println(newString(“中文”.getBytes(GB2312),GB2312));//9
              
     
               System.out.println(newString(“中文”.getBytes(GB2312),ISO8859_1″));//10
     
               System.out.println(newString(“中文”.getBytes(ISO8859_1″)));//11
     
               System.out.println(newString(“中文”.getBytes(ISO8859_1″),utf-8));//12
     
               System.out.println(newString(“中文发送短信”.getBytes(ISO8859_1″),utf-8));//13
              
               //编码与解码
               Stringcont=URLEncoder.encode(newString(“你在干什么啊  33335),utf-8);
               System.out.println(0:”+cont);          
               Stringafter=URLDecoder.decode(cont,utf-8);
               System.out.println(1:”+after);
              
          }catch(Exceptione){
        System.out.println(e.getMessage());
        }
     
    }
  • 相关阅读:
    echo和tee的使用
    cut列的截取
    BZOJ1414: [ZJOI2009]对称的正方形(二维hash)
    BZOJ1010: [HNOI2008]玩具装箱toy
    BZOJ2588: Spoj 10628. Count on a tree(主席树)
    BZOJ3991: [SDOI2015]寻宝游戏(set+lca / 虚树)
    BZOJ2286: [Sdoi2011]消耗战(虚树)
    Linux
    奇妙的棋盘(建图+搜索)
    礼物(动态规划)
  • 原文地址:https://www.cnblogs.com/husam/p/3758283.html
Copyright © 2011-2022 走看看