Url: https://leetcode.com/problems/task-scheduler/description/ Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks.Tasks could be done without original order. Each task could be done in one interval. For each interval, CPU could finish one task or just be idle. ...
-
2018년 1월 23일 -
2017년 11월 28일 [LeetCode] Largest Rectangle in Histogram
Url: https://leetcode.com/problems/largest-rectangle-in-histogram Question: Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram. Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3]. The largest rectangle is shown in the ...
-
2017년 11월 28일 [LeetCode] Merge 2 Sorted LinkedList
Url: https://leetcode.com/problems/merge-two-sorted-lists Question: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 솔직히 너무 쉬운 문제라 안올릴까 했는데 그냥 정리차원에서.. 사이즈를 알 필요도 없고, 단순히 두 개의 리스트 돌면서 그때마다 크기 비교해서 작은 ...
-
2017년 11월 28일 [LeetCode] Merge K Sorted Lists
url: https://leetcode.com/problems/merge-k-sorted-lists Question: Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. k개의 정렬된 링크드 리스트를 합치는 문제. 물론 정렬된 상태의 한개의 리스트로. 다양한 방법이 나올 수 있지만, 가장 처음 생각한 것은 재귀적 방법이다. 두 개의 리스트를 합치는 방법이야 알고 있으니 (리스트 두개를 ...
-
2017년 11월 24일 [LeetCode] 3Sum
Url: https://leetcode.com/problems/3sum/description/ Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain duplicate triplets. For example, given ...
-
2017년 11월 17일 [LeetCode] Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example: Given nums = [2, 7, 11, 15], target = ...