算法-数组
sparksnail
这个作者很懒,什么都没留下…
展开
-
LintCode 6. Merge Two Sorted Arrays
题目思路水题,基本技能。代码class Solution: """ @param A: sorted integer array A @param B: sorted integer array B @return: A new sorted integer array """ def mergeSortedArray(s...原创 2018-02-22 15:08:31 · 276 阅读 · 0 评论 -
LeetCode 128. Longest Consecutive Sequence
题目思路用dict存储数组中所有元素。遍历数组中元素,判断左右元素是否在dict中,记录最大长度。代码class Solution: def longestConsecutive(self, nums): """ :type nums: List[int] :rtype: int """ ...原创 2018-04-04 00:37:30 · 132 阅读 · 0 评论 -
LeetCode 4. Median of Two Sorted Arrays
题目思路分治。在两个数组中寻找第k大的数。 如果nums1[k/2]<nums2[k/2]nums1[k/2]<nums2[k/2]nums1[k/2]nums1[:k/2+1]nums1[:k/2+1]nums1[:k/2+1]中,反之亦然。代码class Solution: def findKthNum(self, nums1, nums2, ...原创 2018-04-15 01:35:57 · 119 阅读 · 0 评论 -
LeetCode 119. Pascal's Triangle II
题目思路滚动数组代码class Solution: def getRow(self, rowIndex): """ :type rowIndex: int :rtype: List[int] """ rowIndex += 1 res_list = [1] ...原创 2018-04-09 00:24:13 · 126 阅读 · 0 评论 -
LeetCode 118. Pascal's Triangle
题目思路用一个list记录上一层的数字,用来更新当前层。代码class Solution: def generate(self, numRows): """ :type numRows: int :rtype: List[List[int]] """ res_list = [] ...原创 2018-04-08 23:59:30 · 113 阅读 · 0 评论 -
LintCode 139. Subarray Sum Closest
题目思路这个题做的好累o(╥﹏╥)o 定义PrefixSum[i]=A[0]+A[1]+…A[i−1],PrefixSum[0]=0PrefixSum[i]=A[0]+A[1]+…A[i−1],PrefixSum[0]=0PrefixSum[i] = A[0] + A[1] + … A[i - 1], PrefixSum[0] = 0 则Sum(i j)=PrefixSu...原创 2018-02-22 22:13:36 · 418 阅读 · 0 评论 -
LintCode 138. Subarray Sum
题目思路trick。如果0−i0−i0-i的和等于0−j0−j0-j的和,那么i−ji−ji-j的和为0。代码class Solution: """ @param: nums: A list of integers @return: A list of integers includes the index of the first number a...原创 2018-02-22 19:36:34 · 292 阅读 · 0 评论 -
LintCode 41. Maximum Subarray
题目思路贪心,更新max值代码class Solution: """ @param nums: A list of integers @return: A integer indicate the sum of max subarray """ def maxSubArray(self, nums): # write ...原创 2018-02-22 19:09:57 · 225 阅读 · 0 评论 -
LintCode 547. Intersection of Two Arrays
题目思路哈希代码class Solution: """ @param: nums1: an integer array @param: nums2: an integer array @return: an integer array """ def intersection(self, nums1, nums2): ...原创 2018-02-22 15:28:54 · 202 阅读 · 0 评论 -
LintCode 64. Merge Sorted Array
题目思路从后向前不断插入新值。代码class Solution: """ @param: A: sorted integer array A which has m elements, but size of A is m+n @param: m: An integer @param: B: sorted integer array B wh...原创 2018-02-22 15:25:24 · 220 阅读 · 0 评论 -
LeetCode 121. Best Time to Buy and Sell Stock
题目思路用两个变量,分别记录最小价格和当前最大利润,不断更新。代码class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ minPrice = 999999 ...原创 2018-04-06 00:39:28 · 126 阅读 · 0 评论