LeetCode
文章平均质量分 71
王顺清1984
移动端开发新手,在技术的世界里不断摸索着前进。。。
展开
-
LeetCode答案 17. Letter Combinations of a Phone Number
17. Letter Combinations of a Phone Number Question Editorial Solution My Submissions Total Accepted: 89976 Total Submissions: 300974 Difficulty: Medium Given a digit原创 2016-07-31 20:24:57 · 318 阅读 · 0 评论 -
LeetCode:152_Maximum Product Subarray | 最大乘积连续子数组 | Medium
题目:Maximum Product Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4], the contiguou原创 2016-09-04 19:09:16 · 277 阅读 · 0 评论 -
【LeetCode】105. Construct Binary Tree from Preorder and Inorder Traversal
Construct Binary Tree from Preorder and Inorder Traversal Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tre转载 2016-09-04 20:51:01 · 189 阅读 · 0 评论 -
347. Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements. For example, Given [1,1,1,2,2,3] and k = 2, return [1,2]. Note: You may assume k is always valid, 1 ≤ k ≤ number of u转载 2016-09-05 19:52:35 · 277 阅读 · 0 评论