09 2018 档案

LeetCode - 347. Top K Frequent Elements
摘要：Given a non-empty array of integers, return the k most frequent elements. Example 1: Example 2: Input: nums = [1], k = 1 Output: [1] Example 2: Note: 阅读全文
posted @ 2018-09-28 17:03 Pickle 阅读(190) 评论(0) 推荐(0) 编辑
LeetCode - 3. Longest Substring Without Repeating Characters
摘要：Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文
posted @ 2018-09-13 16:16 Pickle 阅读(196) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示