摘要：
题目如下： Given an integer n, return any array containing n unique integers such that they add up to 0. Example 1: Example 2: Example 3: Constraints: 1 <= 阅读全文
posted @ 2020-01-04 22:00
seyjs
阅读(310)
评论(0)
推荐(0)
摘要：
题目如下： Given two binary search trees root1 and root2. Return a list containing all the integers from both trees sorted in ascending order. Example 1: E 阅读全文
posted @ 2020-01-04 21:57
seyjs
阅读(229)
评论(0)
推荐(0)
摘要：
题目如下： Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to 阅读全文
posted @ 2020-01-04 21:54
seyjs
阅读(266)
评论(0)
推荐(0)
摘要：
题目如下： Given n boxes, each box is given in the format [status, candies, keys, containedBoxes] where: status[i]: an integer which is 1 if box[i] is open 阅读全文
posted @ 2020-01-04 21:52
seyjs
阅读(316)
评论(0)
推荐(0)
浙公网安备 33010602011771号