当前标签：LeetCode

LeetCode 714. Best Time to Buy and Sell Stock with Transaction Fee

Dylan_Java_NYC 2017-12-28 03:37 阅读:376 评论:0 推荐:0

LeetCode 582. Kill Process

Dylan_Java_NYC 2017-12-27 06:16 阅读:462 评论:0 推荐:0

LeetCode 666. Path Sum IV

Dylan_Java_NYC 2017-12-24 16:28 阅读:510 评论:0 推荐:0

LeetCode 658. Find K Closest Elements

Dylan_Java_NYC 2017-12-02 04:10 阅读:652 评论:0 推荐:0

LeetCode 384. Shuffle an Array

Dylan_Java_NYC 2017-11-30 16:58 阅读:808 评论:0 推荐:0

LeetCode 694. Number of Distinct Islands

Dylan_Java_NYC 2017-11-30 05:26 阅读:1000 评论:0 推荐:0

LeetCode 515. Find Largest Value in Each Tree Row

Dylan_Java_NYC 2017-11-27 13:09 阅读:332 评论:0 推荐:0

LeetCode 311. Sparse Matrix Multiplication

Dylan_Java_NYC 2017-11-26 07:22 阅读:330 评论:0 推荐:0

LeetCode 698. Partition to K Equal Sum Subsets

Dylan_Java_NYC 2017-11-22 14:02 阅读:711 评论:0 推荐:0

LeetCode 716. Max Stack

Dylan_Java_NYC 2017-11-21 09:35 阅读:785 评论:0 推荐:0

LeetCode 364. Nested List Weight Sum II

Dylan_Java_NYC 2017-11-20 14:40 阅读:858 评论:0 推荐:0

LeetCode 535. Encode and Decode TinyURL

Dylan_Java_NYC 2017-11-15 17:05 阅读:317 评论:0 推荐:0

LeetCode 648. Replace Words

Dylan_Java_NYC 2017-11-13 10:16 阅读:378 评论:0 推荐:0

LeetCode 611. Valid Triangle Number

Dylan_Java_NYC 2017-11-05 06:00 阅读:173 评论:0 推荐:0

LeetCode Design TinyURL

Dylan_Java_NYC 2017-11-03 08:33 阅读:459 评论:0 推荐:0

LeetCode 321. Create Maximum Number

Dylan_Java_NYC 2017-11-02 16:35 阅读:251 评论:0 推荐:0

LeetCode 670. Maximum Swap

Dylan_Java_NYC 2017-11-01 15:05 阅读:523 评论:0 推荐:0

LeetCode 713. Subarray Product Less Than K

Dylan_Java_NYC 2017-10-31 14:46 阅读:529 评论:0 推荐:0

LeetCode 560. Subarray Sum Equals K

Dylan_Java_NYC 2017-10-31 13:24 阅读:327 评论:0 推荐:0

LeetCode 621. Task Scheduler

Dylan_Java_NYC 2017-10-29 16:50 阅读:774 评论:0 推荐:0