Skip to content

Peterhuang1kimo patch 2 #27

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Oct 6, 2020
Merged

Peterhuang1kimo patch 2 #27

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
c9a4733
Update 009_Palindrome_Number.py
peterhuang1kimo Oct 6, 2020
bd29755
Update 009_Palindrome_Number.py
peterhuang1kimo Oct 6, 2020
27405ce
Update 035_Search_Insert_Position.py
peterhuang1kimo Oct 6, 2020
9520bb4
fix "list indices must be integers or slices, not float"
peterhuang1kimo Oct 6, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 5 additions & 10 deletions python/009_Palindrome_Number.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,17 +9,12 @@ class Solution(object):
def isPalindrome(self, x):
if x < 0:
return False
ls = 0
ls = len(str(x))
tmp = x
while tmp != 0:
ls += 1
tmp = tmp // 10
tmp = x
for i in range(ls/2):
right = tmp % 10
for i in range(int(ls/2)):
right = int(tmp % 10)
left = tmp / (10 ** (ls - 2 * i - 1))
left = left % 10
# print left, right
left = int(left % 10)
if left != right:
return False
tmp = tmp // 10
Expand Down Expand Up @@ -62,4 +57,4 @@ def isPalindrome(self, x):
if __name__ == '__main__':
# begin
s = Solution()
print s.isPalindrome(1001)
print s.isPalindrome(1001)
14 changes: 11 additions & 3 deletions python/035_Search_Insert_Position.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -23,13 +23,21 @@ class Solution:
# return pos

def searchInsert(self, nums, target):
l, r = 0, len(nums) - 1
l, r = int(0), len(nums) - 1
while l < r:
mid = (l + r) / 2
mid = int((l + r) / 2)
if nums[mid] < target:
l = mid + 1
else:
r = mid
if nums[l] < target:
return l + 1
return l
return l



if __name__ == '__main__':
# begin
s = Solution()
print (s.searchInsert([1,3,5,6],5))