10 2019 档案

摘要:原题链接在这里: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 阅读(289) 评论(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 阅读(758) 评论(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 阅读(260) 评论(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 阅读(328) 评论(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 阅读(451) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示