수쿵의 IT월드

문제You are a professional robber planning to rob houses along a street. Each houst has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houst have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.Given an integer array nums representing the amount of money..

문제Given an integer array nunmsand an integer k, return the kmost frequest elements. You may return the answer in any order. Example 1:Input: nums = [1,1,1,2,2,3], k = 2Output: [1,2] Example 2:Input: nums = [1], k = 1Output: [1] Constraints:1 -10^4 kis in the range [1, the number of unique elements in the array].It is guaranteed that the answer in unique.Follow up: Your algorithm's time complexit..