LiBlog

2016年9月4日

摘要： Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation -- it e 阅读全文

posted @ 2016-09-04 09:09 LiBlog 阅读(96) 评论(0) 推荐(0) 编辑

LeetCode-Create Maximum Number

摘要： Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k <= m + n from digits of the two. Th 阅读全文

posted @ 2016-09-04 08:57 LiBlog 阅读(220) 评论(0) 推荐(0) 编辑

2016年9月3日

LeetCode-Find the Duplicate Number

摘要： Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. 阅读全文

posted @ 2016-09-03 13:19 LiBlog 阅读(153) 评论(0) 推荐(0) 编辑

LeetCode-Paint House II

摘要： There are a row of n houses, each house can be painted with one of the k colors. The cost of painting each house with a certain color is different. Yo 阅读全文

posted @ 2016-09-03 07:58 LiBlog 阅读(138) 评论(0) 推荐(0) 编辑

LeetCode-Closest Binary Search Tree Value II

摘要： Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target. Note: Given target value is a floati 阅读全文

posted @ 2016-09-03 07:27 LiBlog 阅读(146) 评论(0) 推荐(0) 编辑

LeetCode-Word Pattern II

摘要： Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a lette 阅读全文

posted @ 2016-09-03 06:29 LiBlog 阅读(184) 评论(0) 推荐(0) 编辑

LeetCode-Word Pattern

摘要： Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a lette 阅读全文

posted @ 2016-09-03 05:42 LiBlog 阅读(151) 评论(0) 推荐(0) 编辑

LeetCode-Remove Invalid Parentheses

摘要： Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input string may cont 阅读全文

posted @ 2016-09-03 05:27 LiBlog 阅读(221) 评论(0) 推荐(0) 编辑

2016年9月2日

LeetCode-Sparse Matrix Multiplication

摘要： Given two sparse matrices A and B, return the result of AB. You may assume that A's column number is equal to B's row number. Example: Solution: publi 阅读全文

posted @ 2016-09-02 14:14 LiBlog 阅读(132) 评论(0) 推荐(0) 编辑

LeetCode-Burst Balloons

摘要： Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloon 阅读全文

posted @ 2016-09-02 12:39 LiBlog 阅读(136) 评论(0) 推荐(0) 编辑

公告