PJCK - 博客园

2019年5月10日

(DP 线性DP 递推) leetcode 63. Unique Paths II

摘要： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

posted @ 2019-05-10 09:35 PJCK 阅读(110) 评论(0) 推荐(0)

(DP 线性DP 递推) leetcode 62. Unique Paths

摘要： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

posted @ 2019-05-10 09:31 PJCK 阅读(145) 评论(0) 推荐(0)

2019年5月9日

(DP 背包) leetcode 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 yo 阅读全文

posted @ 2019-05-09 19:57 PJCK 阅读(165) 评论(0) 推荐(0)

2019年5月7日

(贪心复习) leetcode 1007. Minimum Domino Rotations For Equal Row

摘要： In a row of dominoes, A[i] and B[i] represent the top and bottom halves of the i-th domino. (A domino is a tile with two numbers from 1 to 6 - one on 阅读全文

posted @ 2019-05-07 13:06 PJCK 阅读(315) 评论(0) 推荐(0)

(贪心) leetcode 452. Minimum Number of Arrows to Burst Balloons

摘要： There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the hor 阅读全文

posted @ 2019-05-07 11:36 PJCK 阅读(146) 评论(0) 推荐(0)

2019年5月6日

(字符串栈) leetcode 921. Minimum Add to Make Parentheses Valid

摘要： Given a string S of '(' and ')' parentheses, we add the minimum number of parentheses ( '(' or ')', and in any positions ) so that the resulting paren 阅读全文

posted @ 2019-05-06 22:19 PJCK 阅读(123) 评论(0) 推荐(0)

(贪心优先队列) leetcode1005. Maximize Sum Of Array After K Negations

摘要： Given an array A of integers, we must modify the array in the following way: we choose an i and replace A[i] with -A[i], and we repeat this process K 阅读全文

posted @ 2019-05-06 22:08 PJCK 阅读(105) 评论(0) 推荐(0)

(贪心) leetcode 122. Best Time to Buy and Sell Stock II

摘要： 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 comple 阅读全文

posted @ 2019-05-06 21:32 PJCK 阅读(174) 评论(0) 推荐(0)

(贪心) 944. Delete Columns to Make Sorted

摘要： We are given an array A of N lowercase letter strings, all of the same length. Now, we may choose any set of deletion indices, and for each string, we 阅读全文

posted @ 2019-05-06 21:16 PJCK 阅读(145) 评论(0) 推荐(0)

(DP 线性DP) leetcode 121. Best Time to Buy and Sell Stock

摘要： Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文

posted @ 2019-05-06 20:37 PJCK 阅读(179) 评论(0) 推荐(0)

2019年5月5日

(BFS 图的遍历的升级版) leetcode 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, 阅读全文

posted @ 2019-05-05 14:30 PJCK 阅读(129) 评论(0) 推荐(0)

2019年5月1日

(BFS 图的遍历) leetcode 752. Open the Lock

摘要： You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rota 阅读全文

posted @ 2019-05-01 10:29 PJCK 阅读(178) 评论(0) 推荐(0)

2019年4月29日

(二叉树 BFS) leetcode103. Binary Tree Zigzag Level Order Traversal

摘要： Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and 阅读全文

posted @ 2019-04-29 20:32 PJCK 阅读(97) 评论(0) 推荐(0)

2019年4月28日

(二叉树 BFS) leetcode993. Cousins in Binary Tree

摘要： In a binary tree, the root node is at depth 0, and children of each depth knode are at depth k+1. Two nodes of a binary tree are cousins if they have 阅读全文

posted @ 2019-04-28 22:42 PJCK 阅读(180) 评论(0) 推荐(0)

(二叉树 BFS) leetcode 107. Binary Tree Level Order Traversal II

摘要： Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For 阅读全文

posted @ 2019-04-28 20:17 PJCK 阅读(125) 评论(0) 推荐(0)