FilesExpand file tree

 master

/

majority-element.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

31 lines (22 loc) · 1.04 KB

 master

/

majority-element.py

Copy path

Top

File metadata and controls

• Code
• Blame

31 lines (22 loc) · 1.04 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

# https://leetcode.com/problems/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.

import unittest

class Solution:

# @param num, a list of integers

# @return an integer

def majorityElement(self, num):

return sorted(num)[len(num)/2]

# This program uses the logic that , if a number appears more than n/2 times in the array - then the n/2-nd element

# should be what we are looking for

# 1. Sort the Array

# 2. Return n/2th element

class TestMajorityElement(unittest.TestCase):

my_solution = Solution()

# looks like this test is missing in l33tcode

def test_empty_array(self):

self.assertEqual(self.my_solution.majorityElement([]),None)

def test_default_pass(self):

self.assertEqual(self.my_solution.majorityElement([1,1,1,1,1]),1)

if __name__ == "__main__":

unittest.main()