169. Majority Element (top interview 150)
되게 쉬워보이긴 하는데, " solve the problem in linear time and in O(1) space?" 이걸 고려해서 조금 더 생각해보자. Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array. Example 1:Input: nums = [3,2,3] Output: 3Example 2:Input: nums = [2,2,1,1,1,2,2] Output: 2 Constraints..