icomputational的专栏

leetcode First Missing Positive

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c)

Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive solution is tr

Suppose a sorted array 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).You are given a target value to search. If found in the array return it

leetcode,动态规划，字符串匹配

leetcode， 二叉树， Binary Tree Maximum Path Sum

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 without altering the nodes' values.For example,Given {1,2,3,4}, reorder it to {1,4

leetcode,Decode Ways， 动态规划

leetcode, Subsets II

leetcode， Jump Game ， 递推求解

leetcode, 递归， Convert Sorted List to Binary Search Tree 的两种解法

leetcode, Maximal Rectangle, 直方图面积计算的O（N）算法，垂线法

leetcode， insort sort list 的两种解法

leetcode, Binary Tree Preorder Traversal , 两种非递归解法， Morris 遍历讲解

leetcode, Edit distance, 最优的O（N）额外空间实现

leetcode，三色排序

Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically n

leetcode, palindrome number

Pascal's Triangle II， leetcode，两个解法

Letter Combinations of a Phone Number, leetcode

leetcode, Regular Expression Matching

Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input case

Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.class Solution {public: int reverse(int x) {

leetcode， Same Tree判定

leetcode, simplify path

Gray code 生成的两种解法， leetcode

combination 的6种解法

Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.用carri

leetcode , Permutation Sequence, 递推

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great": great / \ gr

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at a

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()", wh

leetcode， Gas Station

leetcode , 动态规划， Distinct Subsequences

leetcode, Palindrome Partitioning , 动态规划 + DFS

leetcode， Median of two Sorted Array, MIT algorithm

leet code, words break, 动态规划，F(n) = (F(i) && s.substr( i, n - i)) --- i in range [0, n].