LeetCode in Kotlin
229. Majority Element II
Medium
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.
Example 1:
Input: nums = [3,2,3]
Output: [3]
Example 2:
Input: nums = [1]
Output: [1]
Example 3:
Input: nums = [1,2]
Output: [1,2]
Constraints:
1 <= nums.length <= 5 * 104-109 <= nums[i] <= 109
Follow up: Could you solve the problem in linear time and in O(1) space?
Solution
class Solution {
fun majorityElement(nums: IntArray): List<Int> {
val results: MutableList<Int> = ArrayList()
val len = nums.size
var first = 0
var second = 1
var count1 = 0
var count2 = 0
for (temp in nums) {
if (temp == first) {
count1++
} else if (temp == second) {
count2++
} else if (count1 == 0) {
first = temp
count1++
} else if (count2 == 0) {
second = temp
count2++
} else {
count1--
count2--
}
}
count1 = 0
count2 = 0
for (temp in nums) {
if (temp == first) {
count1++
}
if (temp == second) {
count2++
}
}
if (count1 > len / 3) {
results.add(first)
}
if (count2 > len / 3) {
results.add(second)
}
return results
}
}