ARRAY
独鹿
啊哈
展开
-
leetcode167Two Sum II - Input array is sorted
这个算法易于理解但是效果不是很好class Solution(object): def twoSum(self, numbers, target): """ :type numbers: List[int] :type target: int :rtype: List[int] """原创 2017-05-11 14:23:35 · 215 阅读 · 0 评论 -
565. Array Nesting
class Solution(object): def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ ans=0step = 0 seen = [False] * n f原创 2017-06-06 15:26:58 · 310 阅读 · 0 评论 -
Max Consecutive Ones
找出1的最大连续个数class Solution(object): def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ res=0 step=0 f原创 2017-06-06 16:07:24 · 188 阅读 · 0 评论 -
414. Third Maximum Number
找第3个大的数class Solution(object): def thirdMax(self, nums): """ :type nums: List[int] :rtype: int """ nums = set(nums) if len(nums)转载 2017-06-06 16:17:27 · 204 阅读 · 0 评论 -
380. Insert Delete GetRandom O(1)
class RandomizedSet(object): def __init__(self): """ Initialize your data structure here. """ self.nums, self.pos = [], {} def insert(self, val):转载 2017-06-06 16:39:42 · 189 阅读 · 0 评论 -
229. Majority Element II
class Solution(object): def majorityElement(self, nums): """ :type nums: List[int] :rtype: List[int] """ t = len(nums) / 3 return [n for n in转载 2017-06-06 16:55:07 · 194 阅读 · 0 评论 -
45. Jump Game II
class Solution(object): def jump(self, nums): """ :type nums: List[int] :rtype: int """ n, start, end, step = len(nums), 0, 0, 0 while end转载 2017-06-06 17:00:09 · 166 阅读 · 0 评论 -
55. Jump Game
class Solution(object): def canJump(self, nums): """ :type nums: List[int] :rtype: bool """ m = 0 for i, n in enumerate(nums):转载 2017-06-06 17:02:52 · 163 阅读 · 0 评论 -
57. Insert Interval
# Definition for an interval.# class Interval(object):# def __init__(self, s=0, e=0):# self.start = s# self.end = eclass Solution(object): def insert(self, inter转载 2017-06-06 17:06:35 · 203 阅读 · 0 评论 -
128. Longest Consecutive Sequence
class Solution(object): def longestConsecutive(self, nums): """ :type nums: List[int] :rtype: int """ nums = set(nums) maxlen = 0 wh转载 2017-06-06 17:14:32 · 216 阅读 · 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-22 14:32:32 · 265 阅读 · 0 评论 -
216Combination Sum III
class Solution(object): def combinationSum3(self, k, n): """ :type k: int :type n: int :rtype: List[List[int]] """ cadicates=[x for x in rang原创 2017-06-01 15:19:23 · 201 阅读 · 0 评论 -
54. Spiral Matrix
class Solution(object): def spiralOrder(self, matrix): """ :type matrix: List[List[int]] :rtype: List[int] """ ret = [] while matrix:转载 2017-05-19 17:08:40 · 254 阅读 · 0 评论 -
Combination Sum II
class Solution(object): def combinationSum2(self, candidates, target): """ :type candidates: List[int] :type target: int :rtype: List[List[int]] """原创 2017-05-19 16:21:39 · 170 阅读 · 0 评论 -
121Best Time to Buy and Sell Stock
class Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ if not prices or len(prices)==0: return原创 2017-05-25 10:43:40 · 192 阅读 · 0 评论 -
122. Best Time to Buy and Sell Stock II
class Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ res=0 for i in range(1,len(prices)):原创 2017-05-25 11:52:01 · 304 阅读 · 0 评论 -
26 Remove Duplicates from Sorted Array
题目:删除有序数组中的重复元素,返回长度要求:不能重新分配内存空间解题:class Solution(object): def removeDuplicates(self, nums): """ :type nums: List[int] :rtype: int """原创 2017-05-08 20:41:14 · 171 阅读 · 0 评论 -
27. Remove Element
题目:数组中的重复元素都删掉,且返回长度要求:不可另外开空间解题思路:用两个指针,一个指开头,一个指结尾,当开头的与所给值相同时把结尾的值赋值过来,尾指针向前class Solution(object): def removeElement(self, nums, val): """ :type nums: List[int]原创 2017-05-08 21:34:17 · 213 阅读 · 0 评论 -
leetcode442 Find All Duplicates in an Array
解题思路:将值转化为下表,用值记录个数代码来自:https://leetcode.com/problems/find-all-duplicates-in-an-array/#/descriptionhttps://leetcode.com/problems/find-all-duplicates-in-an-array/#/solutionsclass Solution(objec原创 2017-05-17 15:05:34 · 226 阅读 · 0 评论 -
leetcode31Next Permutation
class Solution(object): def nextPermutation(self, nums): """ :type nums: List[int] :rtype: void Do not return anything, modify nums in-place instead. """原创 2017-05-09 10:38:16 · 167 阅读 · 0 评论 -
[leetcode 33]Search in Rotated Sorted Array
class Solution(object): def search(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ n=len(nums) l,r=原创 2017-05-09 11:08:26 · 172 阅读 · 0 评论 -
35. Search Insert Position
class Solution(object): def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ n=len(nums)原创 2017-05-19 10:10:16 · 201 阅读 · 0 评论 -
34. Search for a Range
class Solution(object): def searchRange(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ l,r=0,len(nums原创 2017-05-19 11:34:23 · 232 阅读 · 0 评论 -
39. Combination Sum
class Solution(object): def combinationSum(self, candidates, target): """ :type candidates: List[int] :type target: int :rtype: List[List[int]] """原创 2017-05-19 16:01:03 · 175 阅读 · 0 评论 -
79. Word Search
class Solution(object): def exist(self, board, word): """ :type board: List[List[str]] :type word: str :rtype: bool """ for i in range(len(boar原创 2017-05-22 15:47:58 · 216 阅读 · 0 评论