-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1.0Task_2.py
More file actions
59 lines (46 loc) · 1.75 KB
/
1.0Task_2.py
File metadata and controls
59 lines (46 loc) · 1.75 KB
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
def isPolinom(x):
s = str(x)
for i in range(len(s)//2+1):
c = s[i]!=s[-1 - i]
if s[i]!=s[-1 - i]:
return False
return True
def longestCommonPrefix(strs):
s = ""
strs.sort(key=len, reverse=True)
for i in range(len(strs[0])):
s = s + strs[0][i]
for word in strs:
if i >= len(word) or word[i] != s[-1]:
s = s[:-1]
return s
return s
def removeDuplicates(nums):
k = 1
for i in range(1, len(nums)):
if nums[i] != nums[k - 1]:
nums[k] = nums[i]
k += 1
return k
def twoSum(nums, target):
nums.sort()
for i in range(len(nums)):
for k in range(i+1, len(nums)):
if nums[i] + nums[k] == target:
return [i,k]
def addBinary( a, b):
result = bin((int(a, 2))+ (int(b, 2)))
return result [2:]
#print(isPolinom(121)) #true
#print(isPolinom(-121)) #false
#print(isPolinom(10)) #fase
#print(longestCommonPrefix(["flower","flow","flight"])) #fl
#print(longestCommonPrefix(["dog","racecar","car"])) #""
#print(longestCommonPrefix(["dog","racecar","car"])) #""
#print(longestCommonPrefix(["","d"])) #""
#removeDuplicates([1,1,2]) #2, nums = [1,2,_]
#print( twoSum([2,7,11,15], 9)) #[0,1]
#print( twoSum([3,2,4], 6)) #[1,2]
#print( twoSum([3,3], 6)) #[0,1]
#print(addBinary("11", "1")) #100
#print(addBinary("1010", "1011")) #10101