LeetCode
文章平均质量分 64
hling_so
这个作者很懒,什么都没留下…
展开
-
23. Merge k Sorted Lists
题目Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.题意合并k个有序链表成1个有序链表分析将合并k个成1个链表 分解为: k个链表两两合并, 之后得到的k’链表再两两合并,直到最后只剩下一个链表实现class S原创 2018-01-07 13:44:19 · 267 阅读 · 0 评论 -
746. Min Cost Climbing Stairs
题目题意cost数组存放了每一级楼梯的花费, 要经过这一级就要付出相应的花费, 每次可以走1~2级, 可以选择从第0级和第1级开始走, 问走到顶(n)的最少花费是多少?(级数从0开始编号,对应开销cost[0])分析一些转化: 可以选择从第0级和第1级开始走->加一个第-1级,cost为0,从-1级出发 走到顶(n)->加一个第n级, cost为0, 走到第n级才算走完(前一步可以是n-1或者n原创 2017-12-24 23:51:24 · 213 阅读 · 0 评论 -
377. Combination Sum IV
题目Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.Example:nums = [1, 2, 3]target = 4The possible c原创 2017-11-25 20:45:47 · 261 阅读 · 0 评论 -
474. Ones and Zeroes
题目In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n 1s respectively. On the other h原创 2017-11-25 20:36:34 · 176 阅读 · 0 评论 -
64. Minimum Path Sum
题目Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at an原创 2017-11-25 20:31:06 · 131 阅读 · 0 评论 -
300. Longest Increasing Subsequence
题目Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7, 101], therefo原创 2017-11-25 20:21:37 · 155 阅读 · 0 评论 -
91. Decode Ways
题目A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total number of原创 2017-11-25 20:05:07 · 148 阅读 · 0 评论 -
303. Range Sum Query - Immutable
题目Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) -> -1sumRange(0, 5)原创 2017-11-25 20:01:08 · 150 阅读 · 0 评论 -
198. House Robber
题目You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent hous原创 2017-11-25 19:55:40 · 144 阅读 · 0 评论 -
718. Maximum Length of Repeated Subarray
题目Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.Example 1:Input:A: [1,2,3,2,1]B: [3,2,1,4,7]Output: 3Explanation: The repeated subarray wit原创 2017-11-25 19:47:14 · 186 阅读 · 0 评论 -
416. Partition Equal Subset Sum
题目Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note: Each of the array elemen原创 2017-12-03 11:51:45 · 162 阅读 · 0 评论 -
213. House Robber II
题目Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, a原创 2017-12-03 11:09:43 · 151 阅读 · 0 评论 -
309. Best Time to Buy and Sell Stock with Cooldown
题目Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one a原创 2017-12-10 21:03:40 · 164 阅读 · 0 评论 -
638. Shopping Offers
题目题意不同的商品i有不同需求needs[i] 有些特价组合special[],对应每一种商品i有相应的数量,买相应的数量就可以用组合价(但是有一些组合未必会比单买便宜) 求恰好买够需求needs[]的的最低总价.分析用动态规划+DFS 每一次调用遍历一次组合special[i], 看剩余的需求里面能不能用组合i的方式购买,如果可以,则使用组合i,并且减去相应的need的数量,剩余的数量再调用原创 2017-12-24 23:51:00 · 388 阅读 · 0 评论 -
513. Find Bottom Left Tree Value
题目Given a binary tree, find the leftmost value in the last row of the tree.Example 1: Input: 2 / \1 3Output: 1 Example 2: Input: 1 / \ 2 3 / / \4 5 6 / 7Output: 7 N原创 2017-12-25 19:14:39 · 167 阅读 · 0 评论 -
4. Median of Two Sorted Arrays
题目There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [1, 3]nums原创 2018-01-07 12:11:42 · 222 阅读 · 0 评论 -
695. Max Area of Island
题目Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surro原创 2017-12-28 19:55:39 · 156 阅读 · 0 评论 -
240. Search a 2D Matrix II
240. Search a 2D Matrix IISearch a 2D Matrix II题目描述题意分治法算法描述具体实现复杂度题目描述Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the follow原创 2017-09-18 14:57:30 · 361 阅读 · 0 评论 -
ex.8.3
题目STINGY SAT is the following problem:given a set of clauses(each a disjunction of literals) and an integer k, find a satisfy assignment in which at most k variables are true, if such an assignment exi原创 2018-01-01 19:23:47 · 191 阅读 · 0 评论 -
238. Product of Array Except Self
题目Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(n).For原创 2017-12-17 22:51:23 · 179 阅读 · 0 评论 -
740. Delete and Earn
题目Given an array nums of integers, you can perform operations on the array.In each operation, you pick any nums[i] and delete it to earn nums[i] points. After, you must delete every element equal ...原创 2017-12-17 22:53:12 · 175 阅读 · 0 评论 -
63. Unique Paths II
题目Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the gr...原创 2017-12-17 22:54:07 · 151 阅读 · 0 评论 -
152. Maximum Product Subarray
题目Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the larges...原创 2017-12-17 22:50:27 · 154 阅读 · 0 评论 -
100. Same Tree
题目Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Example 1:I原创 2017-12-25 20:32:07 · 166 阅读 · 0 评论 -
127. Word Ladder
题目Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter can be changed at a ti原创 2017-12-25 19:53:24 · 178 阅读 · 0 评论 -
104. Maximum Depth of Binary Tree
题目Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.题意分析实现/** * Definition for a binary tree原创 2017-12-25 19:26:15 · 161 阅读 · 0 评论 -
515. Find Largest Value in Each Tree Row
题目You need to find the largest value in each row of a binary tree.Example: Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9]题意分析实现/**/** * Definition for a binary tree no原创 2017-12-25 19:22:23 · 139 阅读 · 0 评论 -
121. Best Time to Buy and Sell Stock
题目题意找到 max(nums[j] - nums[i]) , j > i && nums[j] > nums[i]max(nums[j] - nums[i]) , j&nbs原创 2017-11-16 23:54:14 · 142 阅读 · 0 评论 -
312. Burst Balloons
题目题意炸掉i处的气球能获得nums[i−1]∗nums[i]∗nums[i+1]nums[i-1]*nums[i]*nums[i+1], 用过的气球就没有了, 可以将最左端和最右端看作有一个额外的1, 求总收益的最大值分析参考了这里有例子分析依次遍历不同长度len的子串s[left, right] (left∈[0, n -len], right = left+len-1);用k∈[left,原创 2017-11-16 21:27:22 · 137 阅读 · 0 评论 -
712. Minimum ASCII Delete Sum for Two Strings
Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.Example 1:Input: s1 = "sea", s2 = "eat"Output: 231Explanation: Deleting "s"原创 2017-11-08 09:43:20 · 369 阅读 · 0 评论 -
413. Arithmetic Slices
A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.For example, thes原创 2017-11-07 17:11:27 · 133 阅读 · 0 评论 -
399. Evaluate Division
399. Evaluate Division原创 2017-10-20 13:44:08 · 278 阅读 · 0 评论 -
685. Redundant Connection II
问题描述题意理解算法分析具体实现问题描述In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exa原创 2017-10-27 22:03:47 · 453 阅读 · 0 评论 -
332. Reconstruct Itinerary
332. Reconstruct Itinerary原创 2017-10-15 22:18:42 · 188 阅读 · 0 评论 -
684. Redundant Connection
问题描述In this problem, a tree is an undirected graph that is connected and has no cycles.The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, …, N), with one additio原创 2017-10-26 21:31:38 · 179 阅读 · 0 评论 -
133. Clone Graph
Clone an undirected graph原创 2017-10-05 14:29:11 · 183 阅读 · 0 评论 -
310. Minimum Height Trees
Minimum Height Trees原创 2017-10-08 20:07:55 · 163 阅读 · 0 评论 -
53.Maximum Subarray
最大子串Kadane算法原创 2017-09-11 15:37:35 · 422 阅读 · 0 评论 -
169. Majority Element
find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.原创 2017-09-10 22:04:50 · 187 阅读 · 0 评论 -
215. Kth Largest Element in an Array
Find the kth largest element in an unsorted array.原创 2017-09-18 14:07:44 · 476 阅读 · 0 评论