[LeetCode] 1046. Last Stone Weight - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/last-stone-weight/description/ Last Stone Weight - LeetCode Can you solve this real interview question? Last Stone Weight - You are given an array of integers stones where stones[i] is the weight of the ith stone. We are playing a game with the stones. On each turn, we choose the heaviest two stones and smash them leetcode.com 문제 You are given an array of integers s..
[LeetCode] 347. Top K Frequent Elements - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/top-k-frequent-elements/description/ Top K Frequent Elements - LeetCode Top K Frequent Elements - Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Example 2: Input: nums = [1], k = 1 Output: leetcode.com 문제 Given an integer array nums..
[LeetCode] 23. Merge k Sorted Lists - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/merge-k-sorted-lists/description/ Merge k Sorted Lists - LeetCode Merge k Sorted Lists - You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it. Example 1: Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2, leetcode.com 문제 You are given an array of k link..
HYOJUN
'우선순위큐' 태그의 글 목록