leetcode
Chen-ky
这个作者很懒,什么都没留下…
展开
-
leetcode 461. Hamming Distance
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.class Solution(object):原创 2017-03-21 10:11:42 · 261 阅读 · 0 评论 -
258. Add Digits
循环class Solution(object): def addDigits(self, num): """ :type num: int :rtype: int """ while num >= 10: temp = 0 while num:原创 2017-05-05 00:34:30 · 161 阅读 · 0 评论 -
492. Construct the Rectangle
class Solution(object): def constructRectangle(self, area): """ :type area: int :rtype: List[int] """ l = [] i = math.floor(math.sqrt(area))原创 2017-05-05 10:23:25 · 320 阅读 · 0 评论 -
226. Invert Binary Tree
递归class Solution(object): def invertTree(self, root): """ :type root: TreeNode :rtype: TreeNode """ if root.left != None or root.right!= None: t原创 2017-05-05 00:05:41 · 226 阅读 · 0 评论 -
283. Move Zeroes
欢迎关注我的leetcode习题解答集,不断完善中,希望可以带给你帮助,共同进步 leetcode习题解答集class Solution(object): def moveZeroes(self, nums): """ :type nums: List[int] :rtype: void Do not return anything, mod原创 2017-05-05 00:44:22 · 184 阅读 · 0 评论 -
563. Binary Tree Tilt **
欢迎关注我的leetcode习题解答集,不断完善中,希望可以带给你帮助,共同进步 leetcode习题解答集题意理解:以[1,2,3,4,null,5]为例,在计算点1的倾斜度时,不是3-2=1,而应该是1的左子树的全部之和减去1的右子树的全部之和,即3+5-(2+4)=2,然后加上2的倾斜度4,3的倾斜度5,也就是11开始的时候是这么写的(错误的):class Solution(object):原创 2017-05-05 11:50:52 · 468 阅读 · 0 评论 -
530. Minimum Absolute Difference in BST
欢迎关注我的leetcode习题解答集,不断完善中,希望可以带给你帮助,共同进步 leetcode习题解答集可以对照563. Binary Tree Tilt超时了,思路是把树种的值全部取出来放在list中,然后处理class Solution(object): def getMinimumDifference(self, root): """ :typ原创 2017-05-05 12:32:35 · 240 阅读 · 0 评论 -
506. Relative Ranks
class Solution(object): def findRelativeRanks(self, nums): """ :type nums: List[int] :rtype: List[str] """ sort = sorted(nums,reverse=True) medals =原创 2017-05-05 15:37:04 · 181 阅读 · 0 评论 -
167. Two Sum II - Input array is sorted
class Solution(object): def twoSum(self, numbers, target): """ :type numbers: List[int] :type target: int :rtype: List[int] """ d = dict() fo原创 2017-05-05 20:44:57 · 188 阅读 · 0 评论 -
455. Assign Cookies
超时了class Solution(object): def findContentChildren(self, g, s): """ :type g: List[int] :type s: List[int] :rtype: int """ count = 0 k=[] //已原创 2017-05-05 21:02:11 · 174 阅读 · 0 评论 -
453. Minimum Moves to Equal Array Elements
class Solution(object): def minMoves(self, nums): """ :type nums: List[int] :rtype: int """ s = sum(nums) minNum = min(nums) l = len(nums)原创 2017-05-05 21:28:35 · 203 阅读 · 0 评论 -
383. Ransom Note
原本打算使用list的<运算符,因为set具有比较两个set是否是包含关系的<运算符,但是list的<运算符貌似只能比较list中的元素的个数的多少class Solution(object): def canConstruct(self, ransomNote, magazine): """ :type ransomNote: str :ty原创 2017-05-05 21:51:35 · 201 阅读 · 0 评论 -
349. Intersection of Two Arrays
https://leetcode.com/problems/intersection-of-two-arrays/#/description 先将两个list中的重复元素去掉,即使用set(list)去重,再转化为list即可,这时list中的元素都是没有重复的class Solution(object): def intersection(self, nums1, nums2):原创 2017-05-05 22:28:48 · 192 阅读 · 0 评论 -
404. Sum of Left Leaves
class Solution(object): def sumOfLeftLeaves(self, root): """ :type root: TreeNode :rtype: int """ # def findleft(root): # if root: #原创 2017-05-05 23:33:57 · 293 阅读 · 0 评论 -
387. First Unique Character in a String
# return min(s.find(c) for c in s if s.count(c) == 1 or -1) # return min([s.find(c) for c in s if s.count(c) == 1] or [-1])return min([s.find(c) for c in string.ascii_lowercase if s.count(c)==1] or [原创 2017-05-07 22:11:44 · 219 阅读 · 0 评论 -
171. Excel Sheet Column Number
class Solution(object): def titleToNumber(self, s): """ :type s: str :rtype: int """ sum = 0 n = len(s) for i in range(n)[::-1]:原创 2017-05-07 22:56:30 · 196 阅读 · 0 评论 -
371. Sum of Two Integers
class Solution(object): def getSum(self, a, b): """ :type a: int :type b: int :rtype: int """ # 32 bits integer max MAX = 0x7FFFFFFF原创 2017-05-04 19:59:09 · 229 阅读 · 0 评论 -
389. Find the Difference
class Solution(object): def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ dic ={} for it in s: dic原创 2017-05-04 00:32:11 · 187 阅读 · 0 评论 -
561. Array Partition I
class Solution(object): def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ nums.sort() total = 0 total += sum(nums[0:len原创 2017-05-03 17:08:57 · 196 阅读 · 0 评论 -
566. Reshape the Matrix
class Solution(object): def matrixReshape(self, nums, r, c): """ :type nums: List[List[int]] :type r: int :type c: int :rtype: List[List[int]] """原创 2017-05-03 17:40:04 · 253 阅读 · 0 评论 -
557. Reverse Words in a String III
class Solution(object): def reverseWords(self, s): """ :type s: str :rtype: str """ list = s.split(" ") for i in range(len(list)): list[i]原创 2017-05-03 19:10:22 · 149 阅读 · 0 评论 -
541. Reverse String II
class Solution(object): def reverseStr(self, s, k): """ :type s: str :type k: int :rtype: str """ def reverse(string): return string[::-1原创 2017-05-03 21:01:54 · 174 阅读 · 0 评论 -
476. Number Complement
class Solution(object): def findComplement(self, num): temp = 1<<(len(bin(num))-2) #因为有0b,所以长度减二 temp = temp - 1 num = num ^ temp return numnum.bit_length()原创 2017-03-21 10:12:11 · 215 阅读 · 0 评论 -
500. Keyboard Row
直观做法class Solution(object): def findWords(self, words): """ :type words: List[str] :rtype: List[str] """ list=[] strings=['qwertyuiop','asdfghjkl','原创 2017-05-03 21:31:00 · 168 阅读 · 0 评论 -
412. Fizz Buzz
class Solution(object): def fizzBuzz(self, n): """ :type n: int :rtype: List[str] """ list=[] for i in range(1,n+1): list.append(str(i))原创 2017-05-03 21:53:17 · 182 阅读 · 0 评论 -
496. Next Greater Element I
Suppose we have a decreasing sequence followed by a greater number. For example [5, 4, 3, 2, 1, 6] then the greater number 6 is the next greater element for all previous numbers in the sequence. We us原创 2017-05-03 22:29:15 · 170 阅读 · 0 评论 -
463. Island Perimeter
每一个陆地单元格的周长为4,当两单元格上下或者左右相邻时,令周长减2,每有一个相邻的方块,边就减少两条,判断好边界就没问题了。class Solution(object): def islandPerimeter(self, grid): """ :type grid: List[List[int]] :rtype: int "原创 2017-05-03 22:47:17 · 192 阅读 · 0 评论 -
485. Max Consecutive Ones
class Solution(object): def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ max_count = 0 count = 0 for num in原创 2017-05-03 22:59:04 · 162 阅读 · 0 评论 -
136. Single Number
0异或任何数字都是数字本身,相同的数字异或为0,同时异或有交换律,不因数字的顺序改变,所有相同的经过异或均变为0,和唯一的一个数字异或后就为那个数字。class Solution(object): def singleNumber(self, nums): """ :type nums: List[int] :rtype: int原创 2017-05-03 23:04:07 · 237 阅读 · 0 评论 -
520. Detect Capital
class Solution(object): def detectCapitalUse(self, word): """ :type word: str :rtype: bool """ word_temp = word[1:]; if (word.lower() == word):原创 2017-05-03 23:08:47 · 245 阅读 · 0 评论 -
448. Find All Numbers Disappeared in an Array
class Solution(object): def findDisappearedNumbers(self, nums): """ :type nums: List[int] :rtype: List[int] """ return[i for i in range(1,len(nums)+1) if i n原创 2017-05-03 23:16:00 · 161 阅读 · 0 评论 -
104. Maximum Depth of Binary Tree
递归的方法class Solution(object): def maxDepth(self, root): """ :type root: TreeNode :rtype: int """ if root is None: return 0 else:原创 2017-05-04 00:02:15 · 243 阅读 · 0 评论 -
521. Longest Uncommon Subsequence I
For strings A, B, when len(A) > len(B), the longest possible subsequence of either A or B is A, and no subsequence of B can be equal to A. Answer: len(A).When len(A) == len(B), the only subsequence of原创 2017-05-04 00:21:49 · 194 阅读 · 0 评论 -
504. Base 7
def convertTo7(self, num): if num < 0: return '-' + self.convertTo7(-num) if num < 7: return str(num) return self.convertTo7(num // 7) + str(num % 7)递归的方法def convertTo7(self, num): if n原创 2017-05-10 00:00:58 · 200 阅读 · 0 评论