摘要: All LeetCode Questions List(Part of Answers, still updating) 题目汇总及部分答案(持续更新中) Leetcode problems classified by company 题目按公司分类(Last updated: October 2, 阅读全文
posted @ 2018-02-27 04:37 轻风舞动 阅读(8858) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(4403) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(679) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(473) 评论(1) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(479) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(416) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(428) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(515) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(718) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(1005) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(1102) 评论(0) 推荐(0) 编辑
摘要: 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 轻风舞动 阅读(974) 评论(0) 推荐(0) 编辑