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

    public static void main(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(new String(“中文”.getBytes()));//5
     
               System.out.println(new String(“中文”.getBytes(),”GB2312″));//6
     
               System.out.println(new String(“中文”.getBytes(),”ISO8859_1″));//7
     
               System.out.println(new String(“中文”.getBytes(“GB2312″)));//8
     
               System.out.println(new String(“中文”.getBytes(“GB2312″),”GB2312″));//9
              
     
               System.out.println(new String(“中文”.getBytes(“GB2312″),”ISO8859_1″));//10
     
               System.out.println(new String(“中文”.getBytes(“ISO8859_1″)));//11
     
               System.out.println(new String(“中文”.getBytes(“ISO8859_1″),”utf-8″));//12
     
               System.out.println(new String(“中文发送短信”.getBytes(“ISO8859_1″),”utf-8″));//13
              
               //编码与解码
               String cont=URLEncoder.encode(new String(“你在干什么啊  33335″),utf-8″);
               System.out.println(“0:”+cont);          
               String after=URLDecoder.decode(cont,utf-8″);
               System.out.println(“1:”+after);
              
          } catch (Exception e) {
        System.out.println(e.getMessage());
        }
     
    }
  • 相关阅读:
    PTA 7-6 列出连通集(深搜+广搜)
    TZOJ 2648 小希的迷宫(并查集)
    HDU 3342 Legal or Not(拓扑排序)
    哈夫曼树
    mst
    [THUWC2017]随机二分图
    视察
    [bzoj3274]Circle
    [bzoj3273]liars
    求导相关
  • 原文地址:https://www.cnblogs.com/husam/p/3807498.html
Copyright © 2011-2022 走看看