2018年07月_sparksnail

07月 06月 05月 04月 03月 02月 01月

原创 LeetCode 167. Two Sum II - Input array is sorted

题目代码class Solution: def twoSum(self, numbers, target): """ :type numbers: List[int] :type target: int :rtype: List[int] """ left = 0; righ...

2018-07-10 02:22:44 239

原创 LeetCode 122. Best Time to Buy and Sell Stock II

题目代码class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ count = 0 for i in range(1, len(prices)): ...

2018-07-10 02:21:41 177

原创 LeetCode 665. Non-decreasing Array

题目代码class Solution: def checkPossibility(self, nums): """ :type nums: List[int] :rtype: bool """ count = 0 for i in range(len(nums)): ...

2018-07-10 02:20:35 219

原创 LeetCode 392. Is Subsequence

题目代码class Solution: def isSubsequence(self, s, t): """ :type s: str :type t: str :rtype: bool """ i = 0; j = 0 index = 0 f...

2018-07-10 02:19:32 183

原创 LeetCode 605. Can Place Flowers

题目代码class Solution: def canPlaceFlowers(self, flowerbed, n): """ :type flowerbed: List[int] :type n: int :rtype: bool """ length = len(flo...

2018-07-10 02:18:29 181

原创 LeetCode 763. Partition Labels

题目代码class Solution: def partitionLabels(self, S): """ :type S: str :rtype: List[int] """ tmp_dict = {c:i for i, c in enumerate(S)} res_lis...

2018-07-10 02:17:24 184

原创 LeetCode 406. Queue Reconstruction by Height

题目代码class Solution: def insert(self, people, fromindex, toindex): tmp = people[fromindex] for i in range(toindex + 1, fromindex + 1)[::-1]: people[i] = people...

2018-07-10 02:16:15 174

原创 LeetCode 452. Minimum Number of Arrows to Burst Balloons

题目代码class Solution: def findMinArrowShots(self, points): """ :type points: List[List[int]] :rtype: int """ count = 0 i = 0; j = 0 end ...

2018-07-10 02:14:47 179

原创 LeetCode 435. Non-overlapping Intervals

题目思路贪心代码# Definition for an interval.# class Interval:# def __init__(self, s=0, e=0):# self.start = s# self.end = eclass Solution: def eraseOverlapIntervals(s...

2018-07-10 02:12:04 204