넘치게 채우기

https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/description/leetcode - Reverse Substrings Between Each Pair of Parentheses문제 유형 : 스택문제 난이도 : Medium 문제You are given a string s that consists of lower case English letters and brackets.Reverse the strings in each pair of matching parentheses, starting from the innermost one.Your result should not contain any bracket..

https://leetcode.com/problems/crawler-log-folder/description/leetcode - Crawler Log Folder문제 유형 : 구현문제 난이도 : Easy 문제The Leetcode file system keeps a log each time some user performs a change folder operation.The operations are described below:"../" : Move to the parent folder of the current folder. (If you are already in the main folder, remain in the same folder)."./" : Remain in the same folde..

https://leetcode.com/problems/average-waiting-time/description/leetcode - Average Waiting Time문제 유형: 배열, 구현문제 난이도 : Medium 문제There is a restaurant with a single chef. You are given an array customers, where customers[i] = [arrivali, timei]:arrivali is the arrival time of the ith customer. The arrival times are sorted in non-decreasing order.timei is the time needed to prepare the order of the it..

https://leetcode.com/problems/find-the-winner-of-the-circular-game/description/leetcode - Find the Winner of the Circular Game문제 유형 : 배열문제 난이도 : Medium 문제There are n friends that are playing a game. The friends are sitting in a circle and are numbered from 1 to n in clockwise order. More formally, moving clockwise from the ith friend brings you to the (i+1)th friend for 1  nth friend brings you ..

https://leetcode.com/problems/water-bottles/description/leetcode - water bottles문제 유형 : 구현, 그리디문제 난이도 : Easy 문제There are numBottles water bottles that are initially full of water. You can exchange numExchange empty water bottles from the market with one full water bottle.The operation of drinking a full water bottle turns it into an empty bottle.Given the two integers numBottles and numExchange,..

https://leetcode.com/problems/pass-the-pillow/description/leetcode - Pass the Pillow문제 유형 : 수학, 구현문제 난이도 : Easy 문제There are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every second, the person holding the pillow passes it to the next person standing in the line. Once the pillow reaches the end of the line, the direction changes, an..

https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/description/leetcode - Find the Minimum and Maximum Number of Nodes Between Critical Points문제 유형 : 연결리스트, 슬라이딩 윈도우문제 난이도 : Medium 문제A critical point in a linked list is defined as either a local maxima or a local minima.A node is a local maxima if the current node has a value strictly greater than ..

https://leetcode.com/problems/merge-nodes-in-between-zeros/description/leetcode - Merge Nodes in Between Zeros문제 유형 : 연결리스트, 투 포인터문제 난이도 : Medium 문제You are given the head of a linked list, which contains a series of integers separated by 0's. The beginning and end of the linked list will have Node.val == 0.For every two consecutive 0's, merge all the nodes lying in between them into a single nod..

https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/description/leetcode - Minimum Difference Between Largest and Smallest Value in Three Moves문제 유형 : 그리디, 정렬, 슬라이딩 윈도우문제 난이도 : Medium 문제You are given an integer array nums.In one move, you can choose one element of nums and change it to any value.Return the minimum difference between the largest and ..

https://leetcode.com/problems/intersection-of-two-arrays-ii/description/leetcode - Intersection of Two Arrays II문제 유형 : 그리디, 정렬문제 난이도 : Easy 문제Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order. 두 정수 nums1과 nums2가 주어진다. 두 배열의 합집합을 구하시오.요소는 여러 번 ..