[swift] LeetCode 169. Majority Element

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

var v = 0, res = 0
var dict = [Int: Int]()
nums.forEach {
    var t = 1
    if let n = dict[$0] {
        t = n + 1
    }

    if t > v {
        res = $0
        v = t
    }
    dict[$0] = t
}

return res

var v = 0, res = 0

var dict = [Int: Int]()

nums.forEach {

var t = 1

if let n = dict[$0] {

t = n + 1

}

if t > v {

res = $0

v = t

}

dict[$0] = t

}

return res

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版