LeetCode第一天

1.两数之和

class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        for i in range(len(nums)):
            for j in range(i+1,len(nums)):
                if(nums[i]+nums[j]==target):
                    return [i,j]

7.反转整数

class Solution:
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """

        if(x<0):
            x=-(int(''.join(list(reversed(str(-x))))))
        else:
            x=(int(''.join(list(reversed(str(x))))))
        if(x<-(pow(2,31)) or x>pow(2,31)-1):
            return 0
        else:
            return x

9.回文数

class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        if(x<0):
            return False
        else:
            list1=[]
            while(x>0):
                list1.append(x%10)
                x//=10
            list2=list(reversed(list1))
            if(list1==list2):
                return True
            else:
                return False