leetcode
guojunxiu
这个作者很懒,什么都没留下…
展开
-
Leetcode 526. Beautiful Arrangement
Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of the following is true for the ith position (1 &l...原创 2018-03-21 16:02:18 · 191 阅读 · 0 评论 -
Leetcode 1140. Stone Game II
题目链接:1140. Stone Game II看到 Assuming Alex and Lee play optimally, return the maximum number of stones Alex can get. 这句话以为是博弈论的题,没想到是一道DP。首先定义状态 dp[i][M] 表示从piles[i]开始拿(也就是说当前剩下的piles为 i,i+1,…,ni,i+1,...原创 2019-07-28 22:12:31 · 854 阅读 · 0 评论 -
leetcode 365. Water and Jug Problem DFS BFS
//Time Limit Exceededpublic class Solution{ struct State { public State(long x, long y, long z) { jug = new long[3] {x, y, z }; } public long[] j...原创 2018-08-23 17:05:01 · 467 阅读 · 0 评论 -
leetcode 365. Water and Jug Problem
题目链接裴蜀定理原创 2018-08-13 23:59:17 · 216 阅读 · 0 评论 -
Leetcode 391. Perfect Rectangle
题目链接 Given N axis-aligned rectangles where N > 0, determine if they all together form an exact cover of a rectangular region. Each rectangle is represented as a bottom-left point and a top-r...原创 2018-04-28 22:58:12 · 239 阅读 · 0 评论 -
Leetcode 677. Map Sum Pairs
题目链接 Implement a MapSum class with insert, and sum methods. For the method insert, you’ll be given a pair of (string, integer). The string represents the key and the integer represents the valu...原创 2018-05-07 08:55:20 · 373 阅读 · 0 评论 -
Leetcode 76. Minimum Window Substring
题目链接 Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).自然的想法是从左向右扫,将S[i]加入window。当window满足条件时,尝试从window头踢字符(为了使window最小...原创 2018-05-06 22:45:39 · 138 阅读 · 0 评论 -
Leetcode 148. Sort List
题目链接 Sort a linked list in O(n log n) time using constant space complexity.符合O(n log n)复杂度的算法有快速排序、桶排序、归并排序。其中快速排序需要交换元素不适用于列表;桶排序的空间复杂度为O(n);由于列表的特性,归并排序满足时间、空间复杂度。 唯一的难点就在于如何将列表二分。这里用到了快慢指针的...原创 2018-04-18 22:34:21 · 112 阅读 · 0 评论 -
Leetcode 61. Rotate List
题目链接 Given a list, rotate the list to the right by k places, where k is non-negative. Example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NUL...原创 2018-04-11 23:50:34 · 112 阅读 · 0 评论 -
leetcode 473. Matchsticks to Square
Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You sh...原创 2018-03-27 20:26:33 · 215 阅读 · 0 评论 -
leetcode 1187. Make Array Strictly Increasing [DP]
description和最长递增子序列(LIS)思路很像。对于位置 i ,其取值要满足单调递增的约束,最多有两种情况:arr1[i]来自arr2当位于i+1时,首先查看位置 i 的所有可能取值x,若arr1[i+1]大于x,则arr[i+1]满足单调递增且不会产生操作;若arr1[i+1]<=x,则arr[i+1]不满足单调递增。然后在arr2中寻找第一个大于x的值,该值满足单...原创 2019-09-10 09:58:56 · 639 阅读 · 0 评论