上一页 1 ··· 40 41 42 43 44 45 46 47 48 ··· 68 下一页
摘要: 题目如下: The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two precedi 阅读全文
posted @ 2019-02-15 13:32 seyjs 阅读(377) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are Ncoins total. In one move, we may choose t 阅读全文
posted @ 2019-02-13 14:21 seyjs 阅读(405) 评论(0) 推荐(0) 编辑
摘要: 题目如下: On a broken calculator that has a number showing on its display, we can perform two operations: Double: Multiply the number on the display by 2, 阅读全文
posted @ 2019-02-12 16:49 seyjs 阅读(551) 评论(0) 推荐(0) 编辑
摘要: 题目如下: For a non-negative integer X, the array-form of X is an array of its digits in left to right order. For example, if X = 1231, then the array for 阅读全文
posted @ 2019-02-12 13:46 seyjs 阅读(301) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given an array equations of strings that represent relationships between variables, each string equations[i] has length 4 and takes one of two d 阅读全文
posted @ 2019-02-12 13:15 seyjs 阅读(271) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given an array of integers A, find the number of triples of indices (i, j, k) such that: 0 <= i < A.length 0 <= j < A.length 0 <= k < A.length A 阅读全文
posted @ 2019-02-08 11:57 seyjs 阅读(406) 评论(0) 推荐(0) 编辑
摘要: 题目如下: In a country popular for train travel, you have planned some train travelling one year in advance. The days of the year that you will travel is 阅读全文
posted @ 2019-02-08 11:32 seyjs 阅读(545) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given the root of a binary tree, each node has a value from 0 to 25representing the letters 'a' to 'z': a value of 0 represents 'a', a value of  阅读全文
posted @ 2019-02-06 14:46 seyjs 阅读(243) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order. Return the intersection of these two inter 阅读全文
posted @ 2019-02-03 22:46 seyjs 阅读(448) 评论(0) 推荐(0) 编辑
摘要: 题目如下: We have an array A of integers, and an array queries of queries. For the i-th query val = queries[i][0], index = queries[i][1], we add val to A[ 阅读全文
posted @ 2019-02-03 22:27 seyjs 阅读(376) 评论(0) 推荐(0) 编辑
上一页 1 ··· 40 41 42 43 44 45 46 47 48 ··· 68 下一页