摘要：
原题链接在这里：https://leetcode.com/problems/race-car/ 题目： Your car starts at position 0 and speed +1 on an infinite number line. (Your car can go into negat
阅读全文
posted @ 2019-09-17 10:02
Dylan_Java_NYC
阅读(342)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing/ 题目： We have two integer sequences A and B of the same non-zero lengt
阅读全文
posted @ 2019-09-17 00:59
Dylan_Java_NYC
阅读(439)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/domino-and-tromino-tiling/ 题目： We have two types of tiles: a 2x1 domino shape, and an "L" tromino shape. These s
阅读全文
posted @ 2019-09-16 11:15
Dylan_Java_NYC
阅读(424)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/letter-case-permutation/ 题目： Given a string S, we can transform every letter individually to be lowercase or upp
阅读全文
posted @ 2019-09-12 11:18
Dylan_Java_NYC
阅读(267)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/new-21-game/ 题目： Alice plays the following game, loosely based on the card game "21". Alice starts with 0 points
阅读全文
posted @ 2019-09-09 12:17
Dylan_Java_NYC
阅读(320)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/cheapest-flights-within-k-stops/ 题目： There are n cities connected by m flights. Each fight starts from city u an
阅读全文
posted @ 2019-09-09 09:24
Dylan_Java_NYC
阅读(443)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/longest-turbulent-subarray/ 题目： A subarray A[i], A[i+1], ..., A[j] of A is said to be turbulent if and only if:
阅读全文
posted @ 2019-09-08 00:57
Dylan_Java_NYC
阅读(524)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/knight-dialer/ 题目： A chess knight can move as indicated in the chess diagram below: . This time, we place our ch
阅读全文
posted @ 2019-09-07 14:07
Dylan_Java_NYC
阅读(517)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/minimum-cost-to-merge-stones/ 题目： There are N piles of stones arranged in a row. The i-th pile has stones[i] sto
阅读全文
posted @ 2019-09-04 13:05
Dylan_Java_NYC
阅读(394)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/ 题目： Given an array arr of positive integers, consider all binary trees such
阅读全文
posted @ 2019-09-04 10:54
Dylan_Java_NYC
阅读(2496)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/largest-sum-of-averages/ 题目： We partition a row of numbers A into at most K adjacent (non-empty) groups, then ou
阅读全文
posted @ 2019-09-03 12:43
Dylan_Java_NYC
阅读(359)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/delete-and-earn/ 题目： Given an array nums of integers, you can perform operations on the array. In each operation
阅读全文
posted @ 2019-09-03 11:37
Dylan_Java_NYC
阅读(420)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/maximum-length-of-repeated-subarray/ 题目： Given two integer arrays A and B, return the maximum length of an subar
阅读全文
posted @ 2019-09-03 10:56
Dylan_Java_NYC
阅读(275)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/ 题目： Given two strings s1, s2, find the lowest ASCII sum of deleted cha
阅读全文
posted @ 2019-09-03 07:50
Dylan_Java_NYC
阅读(336)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/longest-common-subsequence/ 题目： Given two strings text1 and text2, return the length of their longest common sub
阅读全文
posted @ 2019-09-03 07:19
Dylan_Java_NYC
阅读(1221)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/increasing-triplet-subsequence/ 题目： Given an unsorted array return whether an increasing subsequence of length 3
阅读全文
posted @ 2019-09-03 05:02
Dylan_Java_NYC
阅读(340)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/minimum-cost-for-tickets/ 题目： In a country popular for train travel, you have planned some train travelling one
阅读全文
posted @ 2019-09-02 01:26
Dylan_Java_NYC
阅读(540)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/arithmetic-slices-ii-subsequence/ 题目： A sequence of numbers is called arithmetic if it consists of at least thre
阅读全文
posted @ 2019-09-01 12:25
Dylan_Java_NYC
阅读(554)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/number-of-corner-rectangles/ 题目： Given a grid where each entry is only 0 or 1, find the number of corner rectang
阅读全文
posted @ 2019-08-31 12:11
Dylan_Java_NYC
阅读(348)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/minimum-falling-path-sum/ 题目： Given a square array of integers A, we want the minimum sum of a falling path thro
阅读全文
posted @ 2019-08-31 02:46
Dylan_Java_NYC
阅读(252)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/stone-game-ii/ 题目： Alex and Lee continue their games with piles of stones. There are a number of piles arranged
阅读全文
posted @ 2019-08-30 11:43
Dylan_Java_NYC
阅读(685)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/stone-game/ 题目： Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a r
阅读全文
posted @ 2019-08-30 11:21
Dylan_Java_NYC
阅读(311)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/circular-array-loop/ 题目： You are given a circular array nums of positive and negative integers. If a number k at
阅读全文
posted @ 2019-08-28 11:44
Dylan_Java_NYC
阅读(412)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/boats-to-save-people/ 题目： The i-th person has weight people[i], and each boat can carry a maximum weight of limi
阅读全文
posted @ 2019-08-28 00:40
Dylan_Java_NYC
阅读(258)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/candy-crush/ 题目： This question is about implementing a basic elimination algorithm for Candy Crush. Given a 2D i
阅读全文
posted @ 2019-08-28 00:20
Dylan_Java_NYC
阅读(406)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/push-dominoes/ 题目： There are N dominoes in a line, and we place each domino vertically upright. In the beginning
阅读全文
posted @ 2019-08-24 15:34
Dylan_Java_NYC
阅读(472)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/statistics-from-a-large-sample/ 题目： We sampled integers between 0 and 255, and stored the results in an array co
阅读全文
posted @ 2019-08-24 12:27
Dylan_Java_NYC
阅读(518)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/interval-list-intersections/ 题目： Given two lists of closed intervals, each list of intervals is pairwise disjoin
阅读全文
posted @ 2019-08-24 00:55
Dylan_Java_NYC
阅读(450)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/ 题目： Given a string and a string dictionary, find the longest string
阅读全文
posted @ 2019-08-24 00:30
Dylan_Java_NYC
阅读(507)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/max-consecutive-ones-iii/ 题目： Given an array A of 0s and 1s, we may change up to K values from 0 to 1. Return th
阅读全文
posted @ 2019-08-23 11:51
Dylan_Java_NYC
阅读(383)
推荐(0)
摘要：
原题链接在这里： 题目： In a row of trees, the i-th tree produces fruit with type tree[i]. You start at any tree of your choice, then repeatedly perform the foll
阅读全文
posted @ 2019-08-23 01:14
Dylan_Java_NYC
阅读(261)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/binary-subarrays-with-sum/ 题目： In an array A of 0s and 1s, how many non-empty subarrays have sum S? Example 1: N
阅读全文
posted @ 2019-08-23 00:43
Dylan_Java_NYC
阅读(370)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/most-profit-assigning-work/ 题目： We have jobs: difficulty[i] is the difficulty of the ith job, and profit[i] is t
阅读全文
posted @ 2019-08-19 13:18
Dylan_Java_NYC
阅读(345)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/3sum-with-multiplicity/ 题目： Given an integer array A, and an integer target, return the number of tuples i, j, k
阅读全文
posted @ 2019-08-19 12:41
Dylan_Java_NYC
阅读(233)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/two-sum-less-than-k/ 题目： Given an array A of integers and integer K, return the maximum S such that there exists
阅读全文
posted @ 2019-08-17 12:05
Dylan_Java_NYC
阅读(2579)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/shortest-distance-to-a-character/ 题目： Given a string S and a character C, return an array of integers representi
阅读全文
posted @ 2019-08-17 11:12
Dylan_Java_NYC
阅读(424)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/max-chunks-to-make-sorted-ii/ 题目： This question is the same as "Max Chunks to Make Sorted" except the integers o
阅读全文
posted @ 2019-08-17 07:03
Dylan_Java_NYC
阅读(346)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/max-chunks-to-make-sorted/ 题目： Given an array arr that is a permutation of [0, 1, ..., arr.length - 1], we split
阅读全文
posted @ 2019-08-17 06:31
Dylan_Java_NYC
阅读(282)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/longest-mountain-in-array/ 题目： Let's call any (contiguous) subarray B (of A) a mountain if the following propert
阅读全文
posted @ 2019-08-16 06:43
Dylan_Java_NYC
阅读(241)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/all-paths-from-source-lead-to-destination/ 题目： Given the edges of a directed graph, and two nodes source and des
阅读全文
posted @ 2019-08-14 08:06
Dylan_Java_NYC
阅读(2255)
推荐(0)
浙公网安备 33010602011771号