zoukankan      html  css  js  c++  java
  • 1.22作业

    第一题:

     ArrayList<Integer> arr1 = new ArrayList<Integer>();
            
            
            for (int i=1 ;i <=100; i++)
            {    
                arr1.add(i);
            }
            arr1.remove(10);
            
            System.out.println("显示集合内容 "+ arr1);

    第二题

    List

    ArrayList<String> arr2 = new ArrayList<String>();
            
            arr2.add("A");
            
            arr2.add("a");
            
            arr2.add("c");
            
            arr2.add("C");
            
            arr2.add("a");
            
            System.out.println("显示arr2集合内容 :"+ arr2);

    Set

    HashSet<String> hs = new HashSet<String>();
            
            hs.add("A");
            
            hs.add("a");
            
            hs.add("c");
            
            hs.add("C");
            
            hs.add("a");
            
            System.out.println("显示hs集合内容 :"+ hs);
    TreeSet <String> ts = new TreeSet<String>();
            
                    ts.add("A");
            
            ts.add("a");
            
            ts.add("c");
            
            ts.add("C");
            
            ts.add("a");
            
            System.out.println("显示ts集合内容 "+ ts);

    第三题

    Map<String, String> hm = new HashMap<String,String>();
            
            hm.put( "001", "天枢");
            
            hm.put("002", "天璇");
            
            hm.put("003", "天玑");
            
            hm.put("004", "天权");
            
            hm.put("005", "玉衡");
            
            hm.put("006", "开阳");
            
            hm.put("007", "瑶光");
            
            HashMap<String,String> emp = new HashMap<String,String>();
            
            emp.putAll(hm);
                
            emp.remove("005");
            
            System.out.println(hm);
            
            for (String key : emp.keySet())
            {
                System.out.println(key + " = " +emp.get(key));
            }

  • 相关阅读:
    BestCoder Round #32
    USACO Runaround Numbers
    USACO Subset Sums
    USACO Sorting a Three-Valued Sequence
    USACO Ordered Fractions
    USACO 2.1 The Castle
    Codeforces Round #252 (Div. 2)
    Codeforces Round #292 (Div. 2)
    BZOJ 1604: [Usaco2008 Open]Cow Neighborhoods 奶牛的邻居
    BZOJ 1603: [Usaco2008 Oct]打谷机
  • 原文地址:https://www.cnblogs.com/baozhaba-xianchong/p/5152409.html
Copyright © 2011-2022 走看看