随笔分类 - LeetCode
摘要：Description A sentence is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only. We would like to c
阅读全文
摘要：Description Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lis
阅读全文
摘要：Description A valid parentheses string is either empty , , or , where and are valid parentheses strings, and represents string concatenation. For exam
阅读全文
摘要：Description Given an array with integers, your task is to check if it could become non decreasing by modifying at most element. We define an array is
阅读全文
摘要：Description Given a tree, rearrange the tree in in order so that the leftmost node in the tree is now the root of the tree, and every node has no left
阅读全文
摘要：Description Given a array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear run
阅读全文
摘要：Description On a table are cards, with a positive integer printed on the front and back of each card (possibly different). We flip any number of cards
阅读全文
摘要：Description Given an array of non negative integers, half of the integers in A are odd, and half of the integers are even. Sort the array so that when
阅读全文
摘要：Description A binary tree is univalued if every node in the tree has the same value. Return true if and only if the given tree is univalued. Example 1
阅读全文
摘要：Description In a array of size , there are unique elements, and exactly one of these elements is repeated N times. Return the element repeated times.
阅读全文
摘要：Description Given an array of integers sorted in non decreasing order, return an array of the squares of each number, also in sorted non decreasing or
阅读全文
摘要：Description Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which m
阅读全文
摘要：Description Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root
阅读全文
摘要：Description The Fibonacci numbers , commonly denoted form a sequence, called the Fibonacci sequence , such that each number is the sum of the two prec
阅读全文
摘要：Description Given the node of a binary search tree, return the sum of values of all nodes with value between and (inclusive). The binary search tree i
阅读全文
摘要：Description 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 na
阅读全文
摘要：Description Given an array A of non negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A
阅读全文
摘要：Description Given a string S of '(' and ')' parentheses, we add the minimum number of parentheses ( '(' or ')', and in any positions ) so that the res
阅读全文
摘要：Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function
阅读全文
摘要：Given a non empty array of digits representing a non negative integer, plus one to the integer. The digits are stored such that the most significant d
阅读全文