03 2019 档案

Sweep Line Algorithm Summary
摘要：Given a set of closed intervals, find the smallest set of numbers that covers all the intervals. If there are multiple smallest sets, return any of th 阅读全文
posted @ 2019-03-30 01:42 Review->Improve 阅读(784) 评论(0) 推荐(0)
Palindrome Algorithm Questions
摘要：Given a string which we can delete at most k, return whether you can make a palindrome. For example, given 'waterrfetawx' and a k of 2, you could dele 阅读全文
posted @ 2019-03-29 12:31 Review->Improve 阅读(294) 评论(0) 推荐(0)
Core Data Structures, Algorithms and Concepts
摘要：Graph: n nodes, m edges Representation Adjacency Matrix: O(n^2) space, not efficient for sparse graph Adjacency List: O(n + m) space, efficient for sp 阅读全文
posted @ 2019-03-08 12:27 Review->Improve 阅读(623) 评论(0) 推荐(0)
[LeetCode] 1000. Minimum Cost to Merge Stones
摘要：There are N piles of stones arranged in a row. The i-th pile has stones[i] stones. A move consists of merging exactly K consecutive piles into one pil 阅读全文
posted @ 2019-03-04 07:49 Review->Improve 阅读(883) 评论(0) 推荐(0)
[LeetCode] 1004. Max Consecutive Ones III
摘要：Given an array A of 0s and 1s, we may change up to K values from 0 to 1. Return the length of the longest (contiguous) subarray that contains only 1s. 阅读全文
posted @ 2019-03-04 00:33 Review->Improve 阅读(766) 评论(0) 推荐(0)
[LeetCode] 1003. Check If Word Is Valid After Substitutions
摘要：We are given that the string "abc" is valid. From any valid string V, we may split V into two pieces X and Y such that X + Y (X concatenated with Y) i 阅读全文
posted @ 2019-03-04 00:14 Review->Improve 阅读(724) 评论(0) 推荐(0)
[LeetCode] 82. Remove Duplicates from Sorted List II
摘要：Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Example 1: Example 2: 阅读全文
posted @ 2019-03-02 13:20 Review->Improve 阅读(125) 评论(0) 推荐(0)
[LeetCode] 907. Sum of Subarray Minimums
摘要：Given an array of integers A, find the sum of min(B), where B ranges over every (contiguous) subarray of A. Since the answer may be large, return the 阅读全文
posted @ 2019-03-02 00:51 Review->Improve 阅读(1228) 评论(0) 推荐(0)