上一页 1 ··· 14 15 16 17 18 19 20 21 22 ··· 53 下一页
摘要: Given a positive integer N, how many ways can we write it as a sum of consecutive positive integers? Example 1: Example 2: Example 3: 分析:https://leetc 阅读全文
posted @ 2019-07-15 11:09 北叶青藤 阅读(238) 评论(0) 推荐(0) 编辑
摘要: Design a HashMap without using any built-in hash table libraries. To be specific, your design should include these functions: put(key, value) : Insert 阅读全文
posted @ 2019-07-15 10:54 北叶青藤 阅读(203) 评论(0) 推荐(0) 编辑
摘要: Given an array w of positive integers, where w[i] describes the weight of index i, write a function pickIndex which randomly picks an index in proport 阅读全文
posted @ 2019-07-15 09:19 北叶青藤 阅读(106) 评论(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 interval li 阅读全文
posted @ 2019-07-15 09:03 北叶青藤 阅读(356) 评论(0) 推荐(0) 编辑
摘要: Design a search autocomplete system for a search engine. Users may input a sentence (at least one word and end with a special character '#'). For each 阅读全文
posted @ 2019-07-15 05:34 北叶青藤 阅读(513) 评论(0) 推荐(0) 编辑
摘要: We have a list of points on the plane. Find the K closest points to the origin (0, 0). (Here, the distance between two points on a plane is the Euclid 阅读全文
posted @ 2019-07-15 02:03 北叶青藤 阅读(351) 评论(0) 推荐(0) 编辑
摘要: Given N, consider a convex N-sided polygon with vertices labelled A[0], A[i], ..., A[N-1] in clockwise order. Suppose you triangulate the polygon into 阅读全文
posted @ 2019-07-09 09:33 北叶青藤 阅读(618) 评论(0) 推荐(0) 编辑
摘要: You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be rep 阅读全文
posted @ 2019-07-08 06:32 北叶青藤 阅读(160) 评论(0) 推荐(0) 编辑
摘要: In English, we have a concept called root, which can be followed by some other words to form another longer word - let's call this word successor. For 阅读全文
posted @ 2019-07-08 05:36 北叶青藤 阅读(180) 评论(0) 推荐(0) 编辑
摘要: In a given integer array nums, there is always exactly one largest element. Find whether the largest element in the array is at least twice as much as 阅读全文
posted @ 2019-07-08 05:10 北叶青藤 阅读(187) 评论(0) 推荐(0) 编辑
上一页 1 ··· 14 15 16 17 18 19 20 21 22 ··· 53 下一页