Jason__Liang的博客

class Solution(object): def numberOfLines(self, widths, S): """ :type widths: List[int] :type S: str :rtype: List[int] """ base=ord('a') #字母a的作...

这道题看到了解法又让我感受到了编程之美。教会了我虽然框架能让人很快写出代码，但是真正优秀的代码总是能够不被框架约束！参考了向北的稻草 的博客class Solution: def sumOfLeftLeaves(self, root): """ :type root: TreeNode :rtype: int """ ...

我用了字典的方式来做这题，挺好玩的题目class Solution: def judgeCircle(self, moves): """ :type moves: str :rtype: bool """ dict={"U":(0,1), "D":(0,-1), ...

class Solution: def isToeplitzMatrix(self, matrix): """ :type matrix: List[List[int]] :rtype: bool """ m=len(matrix) n=len(matrix[0]) for i ...

class Solution: def isIsomorphic(self, s, t): """ :type s: str :type t: str :rtype: boo """ if len(s) != len(t): return False d...

一定要理清逻辑，我在这题上修修补补，打补丁打了半天，最后才发现，如果一开始有清晰的逻辑的话，那么代码会非常简单的。class Solution: def tree2str(self,t): if t is None: return "" s=str(t.val) a=self.tree2str(t.left) ...

class Solution: def countAndSay(self, n): """ :type n: int :rtype: str """ S="1" for i in range(1,n): #控制外层的迭代次数 S=self.myfun(S) ...

人生苦短，我用python我感觉我这种做法太邪恶了。。。class Solution: def addDigits(self, num): """ :type num: int :rtype: int """ num=str(num)#变成字符串来进行处理 count=0 whi...

#思路就是26进制转10进制，这样一说是不是感觉很简单了呢？class Solution(object): def titleToNumber(self, s): """ :type s: str :rtype: int """ base=ord("A")-1 count=0 f...

class Solution(object): def distributeCandies(self, candies): """ :type candies: List[int] :rtype: int """ myset=set()#表示多少种类 for i in candies: ...

class Solution(object): def trimBST(self, root, L, R): """ :type root: TreeNode :type L: int :type R: int :rtype: TreeNode """ if root is ...