随笔分类 - LeetCode
摘要：Sort a linked list in O(n log n) time using constant space complexity. Example 1: Example 2: 使用归并排序
阅读全文
摘要：Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target. E
阅读全文
摘要：Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, two is written as II in Roman numeral, just two one's
阅读全文
摘要：Given a string containing only three types of characters: '(', ')' and '*', write a function to check whether this string is valid. We define the vali
阅读全文
摘要：Given a collection of distinct integers, return all possible permutations. Example:
阅读全文
摘要：Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numb
阅读全文
摘要：Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the
阅读全文
摘要：Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two
阅读全文
摘要：Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. Example 1: Example 2: Note:Your
阅读全文
摘要：You need to find the largest value in each row of a binary tree. Example:
阅读全文
摘要：Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Example 2:
阅读全文
摘要：Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binar
阅读全文
摘要：Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any
阅读全文
摘要：Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: 堆+链表 时间复杂度O(nlogk)
阅读全文
摘要：iven two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Note:
阅读全文
摘要：Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the
阅读全文
摘要：Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the
阅读全文
摘要：Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Y
阅读全文
摘要：Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into k non-empty subsets whose sums are all
阅读全文
摘要：Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You may not modify the values in the list's nodes, only nodes its
阅读全文
浙公网安备 33010602011771号