zoukankan      html  css  js  c++  java
  • List集合添加自定义对象

    public class Student {
         private String name;
         private int age;
         
         public Student() {
            super();
        }
         public Student(String name, int age){
             super();
             this.name = name;
             this.age = age;
         }
        public String getName() {
            return name;
        }
        public void setName(String name) {
            this.name = name;
        }
        public int getAge() {
            return age;
        }
        public void setAge(int age) {
            this.age = age;
        }
         
    }
    =======================================
    package cn.collection;
    
    import java.util.ArrayList;
    import java.util.Iterator;
    import java.util.List;
    
    public class Dome1 {
        public static void main(String[] args) {
            List list = new ArrayList();
            
            Student s1 = new Student("张三",17);
            Student s2 = new Student();
            s2.setName("李四");
            s2.setAge(18);
            
            list.add(s1);
            list.add(s2);
            list.add(new Student("王五",19));//匿名对象
            
            //遍历方式1 :转换成数组
            Object[] obj = list.toArray();
            for(int x=0;x<obj.length;x++){
                Student s = (Student) obj[x];
                System.out.println(s.getName()+":"+s.getAge());
            }
            //遍历方式2:迭代器
            
            Iterator it = list.iterator();
            while(it.hasNext()){
                Student s = (Student) it.next();
                System.out.println(s.getName()+":"+s.getAge());
            }
            
            //便利方式3:增强for
            for(Object s : obj){
                System.out.println(((Student) s).getName()+":"+((Student) s).getAge());
            }
            //遍历方式4 用普通for循环与 get() 和size()结合
            for(int x = 0;x<list.size();x++){
                Student s =  (Student) list.get(x);
                System.out.println(s.getName()+":"+s.getAge());
            }
         }
    }    
  • 相关阅读:
    jchdl
    jchdl
    UVa 10256 (判断两个凸包相离) The Great Divide
    UVa 11168 (凸包+点到直线距离) Airport
    LA 2572 (求可见圆盘的数量) Kanazawa
    UVa 10652 (简单凸包) Board Wrapping
    UVa 12304 (6个二维几何问题合集) 2D Geometry 110 in 1!
    UVa 10674 (求两圆公切线) Tangents
    UVa 11796 Dog Distance
    LA 3263 (平面图的欧拉定理) That Nice Euler Circuit
  • 原文地址:https://www.cnblogs.com/flei/p/6686686.html
Copyright © 2011-2022 走看看