上一页 1 ··· 18 19 20 21 22 23 24 25 26 ··· 68 下一页
摘要: 题目如下: Given a nested list of integers, implement an iterator to flatten it. Each element is either an integer, or a list -- whose elements may also be 阅读全文
posted @ 2019-11-25 10:41 seyjs 阅读(237) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given an array of strings products and a string searchWord. We want to design a system that suggests at most three product names from products a 阅读全文
posted @ 2019-11-25 10:36 seyjs 阅读(609) 评论(0) 推荐(0) 编辑
摘要: 题目如下: You are given a map of a server center, represented as a m * n integer matrix grid, where 1 means that on that cell there is a server and 0 mean 阅读全文
posted @ 2019-11-25 10:30 seyjs 阅读(333) 评论(0) 推荐(0) 编辑
摘要: 题目如下: On a plane there are n points with integer coordinates points[i] = [xi, yi]. Your task is to find the minimum time in seconds to visit all point 阅读全文
posted @ 2019-11-25 10:28 seyjs 阅读(409) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given a 2D grid of size n * m and an integer k. You need to shift the grid k times. In one shift operation: Element at grid[i][j] becomes at gri 阅读全文
posted @ 2019-11-20 10:55 seyjs 阅读(451) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given an array nums of integers, we need to find the maximum possible sum of elements of the array such that it is divisible by three. Example 1 阅读全文
posted @ 2019-11-20 10:50 seyjs 阅读(567) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given a binary tree with the following rules: Now the binary tree is contaminated, which means all treeNode.val have been changed to -1. You nee 阅读全文
posted @ 2019-11-20 10:47 seyjs 阅读(389) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given an array nums of integers, you can perform operations on the array. In each operation, you pick any nums[i] and delete it to earn nums[i]  阅读全文
posted @ 2019-11-20 10:44 seyjs 阅读(262) 评论(0) 推荐(0) 编辑
摘要: 题目如下: A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a dee 阅读全文
posted @ 2019-11-20 10:34 seyjs 阅读(103) 评论(0) 推荐(0) 编辑
摘要: 题目如下: 解题思路:动态规划。记dp[i] = v表示由i个人组成的圈子一共有v种握手的方法。对于一个由n个人组成的圈子,编号为0的人一共可以和编号为 (1,3,5....,n-1)的握手,这也很好理解,假设编号为0的人和编号为2的人握手,那么编号为1的人就被包在两人的连线的一侧,而同侧没有其他人 阅读全文
posted @ 2019-11-20 10:29 seyjs 阅读(430) 评论(0) 推荐(0) 编辑
上一页 1 ··· 18 19 20 21 22 23 24 25 26 ··· 68 下一页