leetcode/268.py at main · joffilyfe/leetcode · GitHub

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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
from typing import List
import unittest


class OptimalSolution:
    def missingNumber(self, nums: List[int]) -> int:
        size = len(nums)
        totalSum = sum(nums)
        expectedSum = ((size + 1) * size) // 2

        return expectedSum - totalSum

class Solution:
    def missingNumber(self, nums: List[int]) -> int:
        nums.sort()
        size = len(nums)

        for i in range(size):
            if i != nums[i]:
                return i

        return size
        # left = 0
        # right = len(nums) - 1

        # while left <= right:
        #     middle = left + (right - left) // 2

        #     if nums[middle] == middle:
        #         left = middle + 1
        #     else:
        #         right = middle - 1


class Test(unittest.TestCase):
    def setUp(self):
        self.solution = Solution()

    @unittest.skip("")
    def test_zero(self):
        self.assertEqual(self.solution.missingNumber(nums=[0]), 1)

    @unittest.skip("")
    def test_first(self):
        self.assertEqual(self.solution.missingNumber(nums=[3, 0, 1]), 2)

    def test_second(self):
        self.assertEqual(self.solution.missingNumber(nums=[0, 1]), 2)

    def test_third(self):
        self.assertEqual(
            self.solution.missingNumber(nums=[9, 6, 4, 2, 3, 5, 7, 0, 1]), 8
        )

    def test_fourth(self):
        self.assertEqual(self.solution.missingNumber(nums=[0, 2, 3]), 1)

    def test_fifth(self):
        self.assertEqual(
            self.solution.missingNumber(nums=[1, 8, 4, 6, 2, 0, 9, 7, 5]), 3
        )


if __name__ == "__main__":
    unittest.main()