💻 Jihun's Ifuwanna IT :: Tech Blog 😃
Queue 검색 결과

해당 글 3건

[HackerLank] Queue using Two Stacks - 문제풀이

Description 두개의 스택을 이용해서 큐를 구현하는 문제입니다. Solution 1. Stack public static void main(String[] args) { /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */ MyQueue q = new MyQueue(); Scanner in = new Scanner(System.in); while(in.hasNext()){ int command = in.nextInt(); if(command == 1) { // enqueue q.enqueue(in.nextInt()); }else if(command ==..
알고리즘/HackerRank 2022. 3. 25. 04:29

[LeetCode] 232. Implement Queue using Stacks - 문제풀이

Description Stack 자료구조를 이용하여 선입선출(First In First Out) 구조의 Queue를 구현하는 문제입니다. Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty). Implement the MyQueue class: void push(int x) Pushes element x to the back of the queue. int pop() Removes the element from the front of the queue and ..
알고리즘/LeetCode 2022. 1. 26. 16:18

[LeetCode] 994. Rotting Oranges - 문제풀이

Description 주어진 매트릭스에서 썩은오렌지(2)가 주위 4방향의 오렌지(1)을 1초에 한칸씩 썩게 만드는데 이때 전체 오렌지를 썩게 만드는데 걸리는 시간을 구하는 문제입니다. You are given an m x n grid where each cell can have one of three values: 0 representing an empty cell, 1 representing a fresh orange, or 2 representing a rotten orange. Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten. Return the minimum number ..
알고리즘/LeetCode 2022. 1. 14. 23:45