原创 LeetCode-E-Two Sum
題意 Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may as
原创 LeetCode-M-Unique Binary Search Trees II
##題意 Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1…n. For examp
原创 LeetCode-E- Palindrome Number
題意 Determine whether an integer is a palindrome. Do this without extra space. click to show spoilers. Subscribe to see
原创 LeetCode-E-Valid Palindrome
題意 Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For ex
原创 LeetCode-M-Binary Tree Level Order Traversal
題意 Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level)
原创 LeetCode-E-Remove Duplicates from Sorted List
題意 Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1-
原创 LeetCode-M-Reorder List
題意 Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place wit
原创 LeetCode-M-Copy List with Random Pointe
題意 A linked list is given such that each node contains an additional random pointer which could point to any node in th
原创 LeetCode - M - Swap Nodes in Pairs
題意 Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should r
原创 LeetCode-E-Isomorphic Strings
題意 Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can b
原创 LeetCode - M - Evaluate Reverse Polish Notation
題意 Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each oper
原创 LeetCode-M-Unique Binary Search Trees
題意 Given n, how many structurally unique BST’s (binary search trees) that store values 1…n? For example, Given n = 3,
原创 LeetCode - H - Reverse Nodes in k-Group
題意 Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive in
原创 LeetCode-M-Jump Game
題意 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element