java-day15

第十五天:

 

1,

                             Collection                                  Map

 

                     List                 Set                  TreeMap   HashTable    HashMap

 

           ArrayList  LinkedList      TreeSet  HashSet

 

           Stack    Queue

 

2,ArrayList:add()   remove()    set()    get()   indexOf()      lastIndexOf()    clear()    isEmpty()    size()

             ArrayList()

             加载因子:0.75             size/length

3,LinkedList:

  1)双向链表

  2)LinkedList()   LinkedList(Collection<? extends E> c)

  3)add()   remove()    set()    get()   indexOf()      lastIndexOf()    clear()    isEmpty()    size()

     removeFirst   removeLast   addFirst   addLast   getFirst   getLast

4,List底层

5,迭代器

        Iterator iter = a.iterator();

        while(iter.hasNext()){

            System.out.println(iter.next());

        }

6,Stack

   push   pop   peek

 

7,Queue

   add   poll   peek

 

 

 

内部类:类中类

    静态内部类

    常规内部类

    局部内部类

    匿名类

接口:1.8开始 接口中可以使用default定义普通方法

 

go语言

 

Stack    Queue    泛型

 

Student

public class Student {

    private String name;

    private int score;

 

    public Student(String name, int score) {

        this.name = name;

        this.score = score;

    }

 

    public Student() {

    }

 

    public String getName() {

        return name;

    }

 

    public void setName(String name) {

        this.name = name;

    }

 

    public int getScore() {

        return score;

    }

 

    public void setScore(int score) {

        this.score = score;

    }

 

    @Override

    public String toString() {

        return "Student{" +

                "name='" + name + '\'' +

                ", score=" + score +

                '}';

    }

}

 

 A

public interface A {

}

 

Test

import java.util.*;

import java.util.concurrent.ArrayBlockingQueue;

import java.util.concurrent.PriorityBlockingQueue;

import java.util.function.UnaryOperator;

 

public class Test {

 

 

    public static void main(String[] args){

        /*LinkedList a = new LinkedList();

        a.add("a");

        a.add("b");

        a.add(1,"c");

        a.addFirst("F");

        a.addLast("L");

 

        Iterator iter = a.iterator();

        while(iter.hasNext()){

            System.out.println(iter.next());

        }

*/

 

 

 

 

 

        //a.remove();

        //a.remove("c");

        //a.remove(2);

        //a.removeFirst();

        //a.removeLast();

 

        //a.set(2,"D");

 

        //System.out.println(a.get(10));;

        //System.out.println(a.getFirst());

        //System.out.println(a.getLast());

        //System.out.println(a.size());

        //a.clear();

 

 

        /*for (Object o:a){

            System.out.print(o+"  ");

        }*/

 

 

        /*Stack s = new Stack();

        s.push("a");

        s.push("b");

        s.push("c");*/

//        s.add(1,"M");

//        System.out.println(s.size());

//        System.out.println(s.pop());

//        System.out.println(s.peek());

//        System.out.println(s.size());

//        System.out.println(s.search("a"));

        /*for(Object o:s){

            System.out.print(o+" ");

        }*/

 

        /*Queue q = new ArrayBlockingQueue(5);

        q.add("d");

        q.add("c");

        q.add("e");

        q.add("a");

        q.add("b");

        System.out.println(q.peek());

        System.out.println(q.poll());

        System.out.println(q.peek());

        System.out.println(q.size());*/

 

//        Queue q1 = new PriorityBlockingQueue();

//        Queue q2 = new Queue

 

       /* Student s1 = new Student("刘德华",85);

        Student s2 = new Student("张学友",100);

        Student s3 = new Student("刘杰",65);

        Student s4 = new Student("章子怡",58);

        Student s5 = new Student("周迅",76);

        LinkedList list = new LinkedList();

        list.add(s1);list.add(s2);list.add(s3);list.add(s4);list.add(s5);

        System.out.println(list.size());

        for (Object o:list){

            Student s = (Student)o;

            if((s.getName().equals("刘杰"))){

                list.remove(s);

                break;

            }

        }

        System.out.println(list);

        for (Object o:list){

            Student s = (Student)o;

            if((s.getName().equals("刘德华"))){

                s.setScore(95);

                break;

            }

        }

        System.out.println(list);

        for (Object o:list){

            Student s = (Student)o;

            if(s.getScore()<60){

                System.out.println(s);

            }

        }*/

        //科特迪瓦,阿根廷,澳大利亚,塞尔维亚,荷兰,尼日利亚、日本,美国,中国,

        //新西兰,巴西,比利时,韩国,喀麦隆,洪都拉斯,意大利

       /* ArrayList list = new ArrayList();

        list.add("科特迪瓦");

        list.add("阿根廷");

        list.add("澳大利亚");

        list.add("塞尔维亚");

        ArrayList a = new ArrayList();

        for (int i=0;i<4;i++){

            int index = (int)(Math.random()*list.size());

            a.add(list.get(index));

            list.remove(index);

        }

        System.out.println(a);*/

       ArrayList list = new ArrayList();

       for (int i=1;i<=15;i++){

           list.add(i);

       }

       int m = 0;//1-7

       int n = -1;//1-list.size()

       while(list.size()>1){

           m++;

           n++;

           if(n==list.size()){

               n = 0;

           }

           if(m==7){

               list.remove(n);

               m = 0;

           }

           if(n==list.size()){

               n = -1;

           }

 

       }

        System.out.println(list.get(0));

 

    }

}

 

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值