摘要：
#-*- coding: UTF-8 -*- class Solution(object): def isPowerOfFour(self, num): """ :type num: int :rtype: bool """ if num<=0:return False while True: if 阅读全文
摘要：
#-*- coding: UTF-8 -*- class Solution(object): def removeElement(self, nums, val): """ :type nums: List[int] :type val: int :rtype: int """ for i in r 阅读全文
摘要：
#-*- coding: UTF-8 -*- class Solution(object): def isPowerOfThree(self, n): if n<=0: return False while True: if n==3 or n==1: return True tuple=divmo 阅读全文
摘要：
class Solution(object): def isUgly(self, num): if num<=0:return False comlist=[2,3,5];modflag=0 while True: if num==1:break for value in comlist: tupl 阅读全文
摘要：
#-*- coding: UTF-8 -*-class Solution(object): def removeDuplicates(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums)<=1:return len(n 阅读全文
摘要：
#-*- coding: UTF-8 -*- # Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solu 阅读全文
摘要：
class Solution(object): def isAnagram(self, s, t): if sorted(list(s.lower()))==sorted(list(t.lower())): return True return Falsesol=Solution()print so 阅读全文
摘要：
#-*- coding: UTF-8 -*- # Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solu 阅读全文
摘要：
#-*- coding: UTF-8 -*-#双栈法class Queue(object): def __init__(self): """ initialize your data structure here. """ self.inStack=[] self.outStack=[] def p 阅读全文
摘要：
#-*- coding: UTF-8 -*- # Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.rig 阅读全文