leetcode python专栏

class Solution: # @param {integer} numerator # @param {integer} denominator # @return {string} def fractionToDecimal(self, numerator, denominator): result='' hashmap=dic

class Solution: # @param {integer} numRows # @return {integer[][]} def generate(self, numRows): tri=[] if numRows==0: return [] cur=[1] tri.appen

class Solution: # @param {integer[]} nums1 # @param {integer} m # @param {integer[]} nums2 # @param {integer} n # @return {void} Do not return anything, modify nums1 in-place instea

class Solution: # @param {integer} n # @return {integer} def climbStairs(self, n): step=[0 for i in range(n+2)] step[0]=1 step[1]=2 if n<=2: retu

class Solution: # @param {string[]} strs # @return {string} def longestCommonPrefix(self, strs): if strs == []: return '' if len(strs)==1: return str

class Solution: # @param {integer} x # @return {integer} def reverse(self, x): max=0x7fffffff min=-0x80000000 flag=False if x<0: flag=True