mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-11-04 14:18:20 +08:00 
			
		
		
		
	feat: add queue in js
This commit is contained in:
		
							
								
								
									
										29
									
								
								codes/javascript/chapter_stack_and_queue/queue.js
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										29
									
								
								codes/javascript/chapter_stack_and_queue/queue.js
									
									
									
									
									
										Normal file
									
								
							@ -0,0 +1,29 @@
 | 
				
			|||||||
 | 
					/**
 | 
				
			||||||
 | 
					 * File: queue.js
 | 
				
			||||||
 | 
					 * Created Time: 2022-12-04
 | 
				
			||||||
 | 
					 * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
 | 
				
			||||||
 | 
					 */
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					/* 初始化队列 */
 | 
				
			||||||
 | 
					// Javascript 没有内置的队列,可以把 Array 当作队列来使用 
 | 
				
			||||||
 | 
					// 但是,要注意虽然Javascript有shift()函数可以去除队首元素,但是时间复杂度是O(n)的。
 | 
				
			||||||
 | 
					const queue = [];
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					/* 元素入队 */
 | 
				
			||||||
 | 
					queue.push(1);
 | 
				
			||||||
 | 
					queue.push(3);
 | 
				
			||||||
 | 
					queue.push(2);
 | 
				
			||||||
 | 
					queue.push(5);
 | 
				
			||||||
 | 
					queue.push(4);
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					/* 访问队首元素 */
 | 
				
			||||||
 | 
					const peek = queue[0];
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					/* 元素出队 */
 | 
				
			||||||
 | 
					const poll = queue.shift();
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					/* 获取队列的长度 */
 | 
				
			||||||
 | 
					const size = queue.length;
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					/* 判断队列是否为空 */
 | 
				
			||||||
 | 
					const empty = queue.length === 0;
 | 
				
			||||||
		Reference in New Issue
	
	Block a user