-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsearch_insert_position.py
More file actions
45 lines (39 loc) · 1005 Bytes
/
search_insert_position.py
File metadata and controls
45 lines (39 loc) · 1005 Bytes
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
# 35. Search Insert Position
# https://leetcode.com/problems/search-insert-position
import unittest
class Solution:
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
find = -1
for i in range(len(nums)):
if target <= nums[i]:
find = i
break
if find == -1:
find = len(nums)
return find
class TestSearchInsertPosition(unittest.TestCase):
def test(self):
sol = Solution()
self.assertEqual(
sol.searchInsert([1, 3, 5, 6], 5),
2
)
self.assertEqual(
sol.searchInsert([1, 3, 5, 6], 2),
1
)
self.assertEqual(
sol.searchInsert([1, 3, 5, 6], 7),
4
)
self.assertEqual(
sol.searchInsert([1, 3, 5, 6], 0),
0
)
if __name__ == '__main__':
unittest.TestCase()