Jasmine_dream

class Solution: def hammingDistance(self, x, y): """ :type x: int :type y: int :rtype: int """ # method one 强行一行解，代码可读性差，程序效率低 # ret

class Solution: def findComplement(self, num): """ :type num: int :rtype: int """ # method one 数据类型的转换较多，优雅，但低效 # return int(''.join(list(m

class Solution: def selfDividingNumbers(self, left, right): """ :type left: int :type right: int :rtype: List[int] """ # method one 思路清晰，但是效

# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def invertTree(se...

很好的复习树结构知识 python 实现树结构的七种遍历

class Solution: # def __init__(self): # self.dic = {1:1, 2:2} def climbStairs(self, n): """ :type n: i

class Solution: def countPrimes(self, n): """ :type n: int :rtype: int """ # 思路一: 简单的遍历除以小于他的数,效率太低了!

class Solution: def singleNumber(self, nums): """ :type nums: List[int] :rtype: int """ # 思路一: 这种简单的遍历太笨拙了 TLE # for

class Solution: def findWords(self, words): """ :type words: List[str] :rtype: List[str] """ #　metho

class Solution: def reverseWords(self, s): """ :type s: str :rtype: str """ # method one 利用字符串的反序以及分离拼接，一行搞定 # return

class Solution: def canWinNim(self, n): """ :type n: int :rtype: bool """ # method one 递归次数爆炸，不可行# if 0 < n < 4:#

class Solution: def hasAlternatingBits(self, n): """ :type n: int :rtype: bool """ # method one 强行一行, 代码效率不够高. 40ms 93% # 重复了bin() 操作 , 不符

class Solution: def rotate(self, nums, k): """ :type nums: List[int] :type k: int :rtype: void Do not return anything, modify nums in-place instead. "&amp

class Solution: def reverseString(self, s): """ :type s: str :rtype: str """ return s[::-1]

// Forward declaration of isBadVersion API.bool isBadVersion(int version);class Solution {public: int firstBadVersion(int n) { int start = 1, end = n; while (start < end) {...

# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def reverseList(self, head, prev = None): ...

# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def maxDepth(self...

class Solution: def removeDuplicates(self, nums): """ :type nums: List[int] :rtype: int """ # 思路一 # for i in range(len(nums)-1,0,-1):

# Write your MySQL query statement below# method one (CASE when ... then ...) 语句的复习# UPDATE salary # SET sex = (CASE when sex='m' then 'f' else 'm' end)# method two IF(expr1,expr2...

# Write your MySQL query statement below# 注意两个筛选条件的顺序影响效率select * from cinema where id % 2 = 1 and description != 'boring'order by rating DESC

# Write your MySQL query statement below# 复习 left join /right join / inner join 的知识# 左连会读取左边表格的所有数据(右边表格没有补null); 右连恰恰相反 ; inner可以省略,是默认值,取两个表格所共有的部分# 方法二比方法一更快一点,可能是不用检索对比列名?# method one# SEL...

class Solution: def uniqueMorseRepresentations(self, words): """ :type words: List[str] :rtype: int """

class Solution: def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ # 一个能

class Solution: def intersect(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int] :rtype: List[int] "&a

class Solution: def firstUniqChar(self, s): """ :type s: str :rtype: int """ # 思路一： 最直观的双重循环想法， TLE# length = len(

class Solution: def strStr(self, haystack, needle): """ :type haystack: str :type needle: str :rtype: int """ # 思路一： 以主串为主干，进行一次遍历。边界条件比较多，不容

class Solution: def judgeCircle(self, moves): """ :type moves: str :rtype: bool """ if moves.count('U') == moves.count('D') and moves.count('L') == move

class Solution: def reverse(self, x): """ :type x: int :rtype: int """ # 思路一：利用字符串的反转（简单但效率略低） if x == 0 : return 0 # 单独处理返回0的情况，反转后有符号整数的范围，

class Solution: def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ # 思路一： 一个笨方法# length = 0# leng = 10

class Solution: def isAnagram(self, s, t): """ :type s: str :type t: str :rtype: bool """ # 相同种类，个数的字母组成，只是字母位置不一样

class Solution: def isPalindrome(self, s): """ :type s: str :rtype: bool """ # 思路一： 手写替换的字母，显然很蠢…… # import re

class Solution: def addDigits(self, num): """ :type num: int :rtype: int """ # method one 数字与字符串的转换 # while num > 9: #

class Solution: def detectCapitalUse(self, word): """ :type word: str :rtype: bool """ # 思路一 # if word.lower() == word or word.capitalize()

class Solution: def plusOne(self, digits): """ :type digits: List[int] :rtype: List[int] """ # 思路一： 整数和字符的转换 return [int(i) for i in str(int

class Solution: def containsDuplicate(self, nums): """ :type nums: List[int] :rtype: bool """ # 巧妙利用元组的特性 return len(nums) != len(set(nums))

class Solution: def moveZeroes(self, nums): """ :type nums: List[int] :rtype: void Do not return anything, modify nums in-place instead.

class Solution: def shortestToChar(self, S, C): """ :type S: str :type C: str :rtype: List[int] """ # method one 笨方法，计算量大 # dic = {}

# Write your MySQL query statement below# method one where 语句# select # a.name AS 'Employee'# from # Employee AS a,# Employee AS b# where # a.ManagerId = b.Id# AND a...

class Solution: def isValidSudoku(self, board): """ :type board: List[List[str]] :rtype: bool """ # 思路一：复杂的分条判断 76ms# for i in range(9):#

class Solution: def nextGreaterElement(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int] :rtype: List[int] ""&qu