HashMap,list,Set,Queue,Deque,Stack的遍历方式

1.HashMap

(1)使用for each循环遍历Map实例的keySet()方法返回的set集合,它包含不重复的key集合

public class Main{

public static void main(String[] args){

Map<String,Integer> map=new HashMap<>();

map.put("apple",123);

map.put("pear",456);

map.put("banana",789);

for(String key:map.keySet()){

Integer value=map.get(key);

System.out.println(key+"="+value);

}

}

}

(2)同时遍历key和value可以使用for each循环遍历Map对象的entrySet()集合，它包含每一个key-value映射：

for(Map.Entry<String,Integer> entry:map.entrySet()){

String key=entry.getKey();

Integer value=entry.getValue();

System.out.println(key+"="+value);

(3)使用Iterator迭代

Map<Integer,Integer> map=new HashMap<Integer,Integer>();

Interator<Map.Entry<Integer,Integer>> entries=map.entrySet().iterator();

while(entries.hasNext()){

Map.Entry<Integer,Integer> entry=entries.next();

System.out.println("Key="+entry.getKey()+",Value="+entry.getValue());

2.list的遍历方式

(1)和数组类型,要遍历一个List,可以用for循环根据索引配合get(int)方式遍历：

public class Main{

public static void main(String[] args){

List<String> list=Arrays.asList("杭州","北京","上海","南京");

for(int i=0;i<list.size();i++){

String s=list.get(i);

System.out.println(s);

}

}

}

(2)用Iterator迭代器

for(Iterator<String> it=list.iterator();it.hasNext();){

String s=it.next();

System.out.println(s);

}

}

}

3.set

(1)foreach遍历

public class Main{

public static void main(String[] args){

Set<String> set=new HashSet<>();

set.add("apple");

set.add("banana");

set.add("pear");

set.add("orange");

for(String s:set){

System.out.println(s);

}

}

}

4.队列

（1）foreach遍历

public class Main{

public static void main(String[] args){

Queue<String> queue=new LinkedList<>();

queue.offer("apple");

queue.offer("pear");

queue.offer("banana");

for(String q:queue){

System.out.println(q);

}

(2)Iterator迭代器

Iterator it=queue.iterator();

while(it.hasNext()){

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

System.out.println("----------");

while(!queue.isEmpty()){

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

(3)poll方法

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

5,Deque

(1)poll方法

Deque<String> deque=new LinkedList<>();
		deque.offerLast("A");
		deque.offerLast("B");
		deque.offerFirst("C");
		deque.offerLast("D");
		deque.offerFirst("E");
		System.out.println(deque);
		System.out.println(deque.pollLast());
		System.out.println(deque.pollLast());
		System.out.println(deque.pollLast());
		System.out.println(deque.pollLast());
		System.out.println(deque.pollLast());

6.stack

(1)foreach遍历

for(String s:stack) {
			System.out.println(s);
		}

（2）pop方法

	while(!stack.isEmpty()) {
			System.out.println(stack.pop());
		}