hellowOOOrld

2017年6月18日

摘要： Given an unsorted integer array, find the first missing positive integer. For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2. Your algorithm s 阅读全文

posted @ 2017-06-18 16:12 hellowOOOrld 阅读(122) 评论(0) 推荐(0)

[leetcode-625-Minimum Factorization]

摘要： Given a positive integer a, find the smallest positive integer b whose multiplication of each digit equals to a. If there is no answer or the answer i 阅读全文

posted @ 2017-06-18 12:57 hellowOOOrld 阅读(400) 评论(0) 推荐(0)

[leetcode-623-Add One Row to Tree]

摘要： Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 阅读全文

posted @ 2017-06-18 11:59 hellowOOOrld 阅读(191) 评论(0) 推荐(0)

[leetcode-624-Maximum Distance in Arrays]

摘要： Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two different arrays (each array picks one) and cal 阅读全文

posted @ 2017-06-18 11:44 hellowOOOrld 阅读(531) 评论(0) 推荐(0)

2017年6月17日

[leetcode-95-Unique Binary Search Trees II]

摘要： Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should 阅读全文

posted @ 2017-06-17 21:44 hellowOOOrld 阅读(153) 评论(0) 推荐(0)

[leetcode-96-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, there are a total of 5 unique BST' 阅读全文

posted @ 2017-06-17 19:02 hellowOOOrld 阅读(166) 评论(0) 推荐(0)

2017年6月14日

[leetcode-131-Palindrome Partitioning]

摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exampl 阅读全文

posted @ 2017-06-14 17:12 hellowOOOrld 阅读(269) 评论(0) 推荐(0)

[leetcode-40-Combination Sum II]

摘要： Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each num 阅读全文

posted @ 2017-06-14 15:12 hellowOOOrld 阅读(190) 评论(0) 推荐(0)

[leetcode-452-Minimum Number of Arrows to Burst Balloons]

摘要： There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the hor 阅读全文

posted @ 2017-06-14 11:09 hellowOOOrld 阅读(182) 评论(0) 推荐(0)

2017年6月12日

[leetcode-434-Number of Segments in a String]

摘要： Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters. Please note that the string 阅读全文

posted @ 2017-06-12 20:17 hellowOOOrld 阅读(128) 评论(0) 推荐(0)

hello world~

公告