Algorithm[Java]16 한 개의 Queue를 이용해 Stack을 구현해보자 (Java) URL : https://leetcode.com/problems/implement-stack-using-queues/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com Leetcode 594. Queue를 이용해 Stack을 구현하는 문제 가끔씩 기술면접을 본 후기를 보면 스택을 이용해 큐를, 혹은 반대로 큐를 이용해 스택을 어떻게 구현할 .. 2024. 1. 19. Leetcode 594. Longest Harmonious Subsequence (Java 풀이) - Hash Table URL : https://leetcode.com/problems/longest-harmonious-subsequence/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 1. 문제 설명 먼저 문제를 읽어보겠습니다.. We define a harmonious array as an array where the difference between.. 2024. 1. 18. Leetcode 424. Longest Repeating Character Replacement (Java 풀이) - Sliding Window URL : https://leetcode.com/problems/longest-repeating-character-replacement/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 안녕하세요, 오늘은 Leetcode의 424번 문제, Longest Repeating Character Replacement에 대해서 알아보겠습니다! 먼저.. 2024. 1. 17. [Backjoon - 3052] [Java] 나머지 링크 : https://www.acmicpc.net/problem/3052 3052번: 나머지 각 수를 42로 나눈 나머지는 39, 40, 41, 0, 1, 2, 40, 41, 0, 1이다. 서로 다른 값은 6개가 있다. www.acmicpc.net [Backjoon - 3052] [Java] 나머지 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; class Main { public static void main(String[] args) throws IOException{ BufferedReader br = new Buffer.. 2022. 3. 3. 이전 1 2 3 4 다음
