上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 26 下一页
摘要: 原题链接在这里:https://leetcode.com/problems/open-the-lock/ 题目: You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2 阅读全文
posted @ 2019-11-26 11:33 Dylan_Java_NYC 阅读(455) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/the-maze-iii/ 题目: There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by 阅读全文
posted @ 2019-11-25 12:43 Dylan_Java_NYC 阅读(691) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/the-maze-ii/ 题目: There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by 阅读全文
posted @ 2019-11-25 11:36 Dylan_Java_NYC 阅读(827) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/the-maze/ 题目: There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rol 阅读全文
posted @ 2019-11-25 11:04 Dylan_Java_NYC 阅读(536) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/n-ary-tree-level-order-traversal/ 题目: Given an n-ary tree, return the level order traversal of its nodes' values 阅读全文
posted @ 2019-11-24 14:22 Dylan_Java_NYC 阅读(291) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/online-election/ 题目: In an election, the i-th vote was cast for persons[i] at time times[i]. Now, we would like 阅读全文
posted @ 2019-11-24 13:30 Dylan_Java_NYC 阅读(186) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/binary-search/ 题目: Given a sorted (in ascending order) integer array nums of n elements and a target value, writ 阅读全文
posted @ 2019-11-24 12:07 Dylan_Java_NYC 阅读(371) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/ 题目: Given an integer array sorted in ascending order, write a function 阅读全文
posted @ 2019-11-24 12:03 Dylan_Java_NYC 阅读(1303) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/time-based-key-value-store/ 题目: Create a timebased key-value store class TimeMap, that supports two operations. 阅读全文
posted @ 2019-11-24 11:49 Dylan_Java_NYC 阅读(567) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/find-right-interval/ 题目: Given a set of intervals, for each of the interval i, check if there exists an interval 阅读全文
posted @ 2019-11-24 11:23 Dylan_Java_NYC 阅读(182) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/missing-element-in-sorted-array/ 题目: Given a sorted array A of unique numbers, find the K-th missing number star 阅读全文
posted @ 2019-11-21 02:29 Dylan_Java_NYC 阅读(2230) 评论(0) 推荐(1) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/ 题目: A conveyor belt has packages that must be shipped from one port to 阅读全文
posted @ 2019-11-20 13:28 Dylan_Java_NYC 阅读(699) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/koko-eating-bananas/ 题目: Koko loves to eat bananas. There are N piles of bananas, the i-th pile has piles[i] ban 阅读全文
posted @ 2019-11-18 08:59 Dylan_Java_NYC 阅读(709) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/my-calendar-iii/ 题目: Implement a MyCalendarThree class to store your events. A new event can always be added. Yo 阅读全文
posted @ 2019-11-17 03:28 Dylan_Java_NYC 阅读(266) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/my-calendar-ii/ 题目: Implement a MyCalendarTwo class to store your events. A new event can be added if adding the 阅读全文
posted @ 2019-11-17 03:18 Dylan_Java_NYC 阅读(232) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/exam-room/ 题目: In an exam room, there are N seats in a single row, numbered 0, 1, 2, ..., N-1. When a student en 阅读全文
posted @ 2019-11-14 15:16 Dylan_Java_NYC 阅读(232) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/hand-of-straights/ 题目: Alice has a hand of cards, given as an array of integers. Now she wants to rearrange the 阅读全文
posted @ 2019-11-14 13:30 Dylan_Java_NYC 阅读(243) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/camelcase-matching/ 题目: A query word matches a given pattern if we can insert lowercase letters to the pattern w 阅读全文
posted @ 2019-11-14 11:47 Dylan_Java_NYC 阅读(240) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/map-sum-pairs/ 题目: Implement a MapSum class with insert, and sum methods. For the method insert, you'll be given 阅读全文
posted @ 2019-11-13 13:10 Dylan_Java_NYC 阅读(283) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/implement-magic-dictionary/ 题目: Implement a magic directory with buildDict, and search methods. For the method b 阅读全文
posted @ 2019-11-13 12:46 Dylan_Java_NYC 阅读(259) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/additive-number/ 题目: Additive number is a string whose digits can form additive sequence. A valid additive seque 阅读全文
posted @ 2019-11-12 12:46 Dylan_Java_NYC 阅读(515) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/ 题目: Given an array of strings arr. String s is a 阅读全文
posted @ 2019-11-11 11:54 Dylan_Java_NYC 阅读(1193) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/stepping-numbers/ 题目: A Stepping Number is an integer such that all of its adjacent digits have an absolute diff 阅读全文
posted @ 2019-11-11 10:22 Dylan_Java_NYC 阅读(814) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/split-array-into-fibonacci-sequence/ 题目: Given a string S of digits, such as S = "123456579", we can split it in 阅读全文
posted @ 2019-11-10 11:37 Dylan_Java_NYC 阅读(548) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/brace-expansion/ 题目: A string S represents a list of words. Each letter in the word has 1 or more options. If th 阅读全文
posted @ 2019-11-04 12:54 Dylan_Java_NYC 阅读(1502) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/path-with-maximum-gold/ 题目: In a gold mine grid of size m * n, each cell in this mine has an integer representin 阅读全文
posted @ 2019-11-04 11:53 Dylan_Java_NYC 阅读(627) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/letter-tile-possibilities/ 题目: You have a set of tiles, where each tile has one letter tiles[i] printed on it. R 阅读全文
posted @ 2019-11-04 11:08 Dylan_Java_NYC 阅读(608) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/last-stone-weight-ii/ 题目: We have a collection of rocks, each rock has a positive integer weight. Each turn, we 阅读全文
posted @ 2019-11-03 08:12 Dylan_Java_NYC 阅读(681) 评论(0) 推荐(1) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/last-stone-weight/ 题目: We have a collection of rocks, each rock has a positive integer weight. Each turn, we cho 阅读全文
posted @ 2019-11-03 06:53 Dylan_Java_NYC 阅读(627) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/largest-1-bordered-square/ 题目: Given a 2D grid of 0s and 1s, return the number of elements in the largest square 阅读全文
posted @ 2019-11-03 05:59 Dylan_Java_NYC 阅读(640) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/largest-plus-sign/ 题目: In a 2D grid from (0, 0) to (N-1, N-1), every cell contains a 1, except those cells in th 阅读全文
posted @ 2019-11-01 12:50 Dylan_Java_NYC 阅读(210) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/filling-bookcase-shelves/ 题目: We have a sequence of books: the i-th book has thickness books[i][0] and height bo 阅读全文
posted @ 2019-11-01 11:28 Dylan_Java_NYC 阅读(306) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/longest-arithmetic-sequence/ 题目: Given an array A of integers, return the length of the longest arithmetic subse 阅读全文
posted @ 2019-11-01 09:17 Dylan_Java_NYC 阅读(679) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/ 题目: A sequence X_1, X_2, ..., X_n is fibonacci-like if: n >= 3 X_i + X_ 阅读全文
posted @ 2019-10-31 11:28 Dylan_Java_NYC 阅读(286) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/longest-string-chain/ 题目: Given a list of words, each word consists of English lowercase letters. Let's say word 阅读全文
posted @ 2019-10-28 08:49 Dylan_Java_NYC 阅读(757) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/remove-boxes/ 题目: Given several boxes with different colors represented by different positive numbers.You may ex 阅读全文
posted @ 2019-10-12 12:29 Dylan_Java_NYC 阅读(256) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/cherry-pickup/ 题目: In a N x N grid representing a field of cherries, each cell is one of three possible integers 阅读全文
posted @ 2019-10-11 12:08 Dylan_Java_NYC 阅读(323) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/reverse-pairs/ 题目: Given an array nums, we call (i, j) an important reverse pair if i < j and nums[i] > 2*nums[j 阅读全文
posted @ 2019-10-05 09:22 Dylan_Java_NYC 阅读(447) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/minimum-score-triangulation-of-polygon/ 题目: Given N, consider a convex N-sided polygon with vertices labelled A[ 阅读全文
posted @ 2019-09-24 00:43 Dylan_Java_NYC 阅读(382) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/video-stitching/ 题目: You are given a series of video clips from a sporting event that lasted T seconds. These vi 阅读全文
posted @ 2019-09-22 03:14 Dylan_Java_NYC 阅读(619) 评论(0) 推荐(0) 编辑
上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 26 下一页