mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-11-01 03:24:24 +08:00 
			
		
		
		
	 a005c6ebd3
			
		
	
	a005c6ebd3
	
	
	
		
			
			* Update avatar's link in the landing page * Bug fixes * Move assets folder from overrides to docs * Reduce figures' corner radius * Update copyright * Update header image * Krahets -> krahets * Update the landing page
		
			
				
	
	
		
			41 lines
		
	
	
		
			1.0 KiB
		
	
	
	
		
			Java
		
	
	
	
	
	
			
		
		
	
	
			41 lines
		
	
	
		
			1.0 KiB
		
	
	
	
		
			Java
		
	
	
	
	
	
| /**
 | |
|  * File: queue.java
 | |
|  * Created Time: 2022-11-25
 | |
|  * Author: krahets (krahets@163.com)
 | |
|  */
 | |
| 
 | |
| package chapter_stack_and_queue;
 | |
| 
 | |
| import java.util.*;
 | |
| 
 | |
| public class queue {
 | |
|     public static void main(String[] args) {
 | |
|         /* 初始化队列 */
 | |
|         Queue<Integer> queue = new LinkedList<>();
 | |
| 
 | |
|         /* 元素入队 */
 | |
|         queue.offer(1);
 | |
|         queue.offer(3);
 | |
|         queue.offer(2);
 | |
|         queue.offer(5);
 | |
|         queue.offer(4);
 | |
|         System.out.println("队列 queue = " + queue);
 | |
| 
 | |
|         /* 访问队首元素 */
 | |
|         int peek = queue.peek();
 | |
|         System.out.println("队首元素 peek = " + peek);
 | |
| 
 | |
|         /* 元素出队 */
 | |
|         int pop = queue.poll();
 | |
|         System.out.println("出队元素 pop = " + pop + ",出队后 queue = " + queue);
 | |
| 
 | |
|         /* 获取队列的长度 */
 | |
|         int size = queue.size();
 | |
|         System.out.println("队列长度 size = " + size);
 | |
| 
 | |
|         /* 判断队列是否为空 */
 | |
|         boolean isEmpty = queue.isEmpty();
 | |
|         System.out.println("队列是否为空 = " + isEmpty);
 | |
|     }
 | |
| }
 |