zoukankan      html  css  js  c++  java
  • 包装类

    import java.io.File;
    import java.io.FileReader;
    
    /**
     * 包装类
     * 详解:http://alexyyek.github.io/2014/12/29/wrapperClass/
     */
    public class WrappClassTest {
        public static void main(String[] args) {
            Integer a = 1;
            Integer b = 2;
            Integer c = 3;
            Integer d = 3;
            Integer e = 200;
            Integer f = 200;
            Long g = 3L;
            Long h = 2L;
    
            System.out.println("c == d -> " + (c == d));
            System.out.println("e == f -> " + (e == f));
            System.out.println("c == (a + b) -> " + (c == (a + b)));
            System.out.println("c.equals(a + b) -> " + (c.equals(a + b)));
            System.out.println("g == (a + b) -> " + (g == (a + b)));
            System.out.println("g.equals(a + b) -> " + (g.equals(a + b)));
            System.out.println("g.equals(a + h) -> " + (g.equals(a + h)));
    
    
            String s1 = "ab";
            String s2 = "a" + "b";
            String s4 = new String("ab");
            String s5 = new String("ab");
            String str1 = "a";
            String str2 = "b";
    
            String s3 = str1 + str2;
            System.out.println(s1 == s2);
            System.out.println(s1 == s3);
            System.out.println(s3);
            System.out.println(s1 == s4);
            System.out.println(s5 == s4);
            System.out.println(s5.equals(s4));
            System.out.println(s5.hashCode() == s4.hashCode());
    
    
        }
    }

    结果

    c == d -> true
    e == f -> false
    c == (a + b) -> true
    c.equals(a + b) -> true
    g == (a + b) -> true
    g.equals(a + b) -> false
    g.equals(a + h) -> true
    true
    false
    ab
    false
    false
    true
    true
  • 相关阅读:
    AC自动机模板
    hdu 6034 贪心模拟 好坑
    UVA 10870
    hdu 2604 递推 矩阵快速幂
    hdu 3117 Fibonacci Numbers 矩阵快速幂+公式
    hdu 1575 Tr A 矩阵快速幂
    POJ_1151 扫描线+离散化+线段树
    HDU_2227 求不减子序列的个数(树状数组+DP)
    深夜敲模板_5——KMP
    深夜敲模板_4——无向图的割顶和桥
  • 原文地址:https://www.cnblogs.com/dayaodao/p/8697136.html
Copyright © 2011-2022 走看看