[置顶] All LeetCode Questions List 题目汇总
摘要： All LeetCode Questions List（Part of Answers, still updating） 题目汇总及部分答案（持续更新中） Leetcode problems classified by company 题目按公司分类(Last updated: October 2, 阅读全文
posted @ 2018-02-27 04:37 轻风舞动 阅读(9547) 评论(0) 推荐(0) 编辑
[置顶] Leetcode problems classified by company 题目按公司分类(Last updated: October 2, 2017)
摘要： All LeetCode Questions List 题目汇总 Sorted by frequency of problems that appear in real interviews. Last updated: October 2, 2017Google (214)534 Design T 阅读全文
posted @ 2018-02-27 03:41 轻风舞动 阅读(4608) 评论(0) 推荐(0) 编辑
2019年4月10日
[LeetCode] 929. Unique Email Addresses 唯一的电邮地址
摘要： Every email consists of a local name and a domain name, separated by the @ sign. For example, in alice@leetcode.com, alice is the local name, and leet 阅读全文
posted @ 2019-04-10 14:41 轻风舞动 阅读(785) 评论(0) 推荐(0) 编辑
[LeetCode] 565. Array Nesting 数组嵌套
摘要： A zero-indexed array A of length N contains all integers from 0 to N-1. Find and return the longest length of set S, where S[i] = {A[i], A[A[i]], A[A[ 阅读全文
posted @ 2019-04-10 03:37 轻风舞动 阅读(553) 评论(1) 推荐(0) 编辑
2019年3月5日
[LeetCode] 769. Max Chunks To Make Sorted 可排序的最大块数
摘要： Given an array arr that is a permutation of [0, 1, ..., arr.length - 1], we split the array into some number of "chunks" (partitions), and individuall 阅读全文
posted @ 2019-03-05 09:39 轻风舞动 阅读(573) 评论(0) 推荐(0) 编辑
[LeetCode] 768. Max Chunks To Make Sorted II 可排序的最大块数 II
摘要： This question is the same as "Max Chunks to Make Sorted" except the integers of the given array are not necessarily distinct, the input array could be 阅读全文
posted @ 2019-03-05 09:28 轻风舞动 阅读(528) 评论(0) 推荐(0) 编辑
2019年3月2日
[LeetCode] 901. Online Stock Span 线上股票跨度
摘要： Write a class StockSpanner which collects daily price quotes for some stock, and returns the span of that stock's price for the current day. The span 阅读全文
posted @ 2019-03-02 08:47 轻风舞动 阅读(496) 评论(0) 推荐(0) 编辑
[LeetCode] 334. Increasing Triplet Subsequence 递增三元子序列
摘要： Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Note: Your algo 阅读全文
posted @ 2019-03-02 07:34 轻风舞动 阅读(633) 评论(0) 推荐(0) 编辑
2018年12月21日
[LeetCode] 641.Design Circular Deque 设计环形双向队列
摘要： Design your implementation of the circular double-ended queue (deque). Your implementation should support following operations: MyCircularDeque(k): Co 阅读全文
posted @ 2018-12-21 10:02 轻风舞动 阅读(823) 评论(0) 推荐(0) 编辑
[LeetCode] 622.Design Circular Queue 设计环形队列
摘要： Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (F 阅读全文
posted @ 2018-12-21 09:58 轻风舞动 阅读(1178) 评论(0) 推荐(0) 编辑
2018年12月4日
[LeetCode] 737. Sentence Similarity II 句子相似度 II
摘要： Given two sentences words1, words2 (each represented as an array of strings), and a list of similar word pairs pairs, determine if two sentences are s 阅读全文
posted @ 2018-12-04 14:32 轻风舞动 阅读(1396) 评论(0) 推荐(0) 编辑
[LeetCode] 734. Sentence Similarity 句子相似度
摘要： Given two sentences words1, words2 (each represented as an array of strings), and a list of similar word pairs pairs, determine if two sentences are s 阅读全文
posted @ 2018-12-04 13:50 轻风舞动 阅读(1299) 评论(0) 推荐(0) 编辑
下一页