find the majority element

最新推荐文章于 2019-11-02 16:37:14 发布

weixin_30266829

最新推荐文章于 2019-11-02 16:37:14 发布

阅读量157

点赞数

文章标签： runtime

原文链接：http://www.cnblogs.com/miaoz/p/4182147.html

版权

1. Runtime: O(n) — Moore voting algorithm: We maintain a current candidate and a counter initialized to 0. As we iterate the array, we look at the current element x:
  1. If the counter is 0, we set the current candidate to x and the counter to 1.
  2. If the counter is not 0, we increment or decrement the counter based on whether x is the current candidate.
  After one pass, the current candidate is the majority element. Runtime complexity = O(n).

转载于:https://www.cnblogs.com/miaoz/p/4182147.html