正文内容加载中...
posted @ 2016-01-23 10:51 Chapter 阅读(99) 评论(0) 推荐(0) 编辑
摘要: 完全没有思路1. Sudoku Solver2. Unique BST II [递归思路]3.Sorted List to BST [O(n)时间复杂度]4. Surrounded Regions [DFS转BFS]5. palindrome partitioning II [dp递推式]6.Gas... 阅读全文
posted @ 2015-09-24 11:47 Chapter 阅读(101) 评论(0) 推荐(0) 编辑
摘要: 如何判断点P是否在三角形ABC内?http://blog.csdn.net/stpeace/article/details/8104906 阅读全文
posted @ 2015-08-25 20:52 Chapter 阅读(197) 评论(0) 推荐(0) 编辑
摘要: [完全没有思路]Array1. Remove Duplicates from Sorted Array IITree1. Symmetric Tree (No Recursion Solution: two queues)2.UniqueBinarySearchTreesIIHashTable1. ... 阅读全文
posted @ 2015-08-24 14:27 Chapter 阅读(135) 评论(0) 推荐(0) 编辑
摘要: http://www.pep.com.cn/gzsxb/xszx/jtzd/201009/t20100928_916071.htm 阅读全文
posted @ 2015-08-24 11:15 Chapter 阅读(113) 评论(0) 推荐(0) 编辑
摘要: Problem I: Roman to IntegerGiven a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.解决思路1.将字符和整数存入map... 阅读全文
posted @ 2015-08-19 19:48 Chapter 阅读(250) 评论(0) 推荐(0) 编辑
摘要: Problem IGiven an array of integers, every element appearstwiceexcept for one. Find that single one.解决思路全部的元素进行异或,输出结果。ProblemIIGiven an array of inte... 阅读全文
posted @ 2015-08-19 17:15 Chapter 阅读(139) 评论(0) 推荐(0) 编辑
摘要: Problem IWrite a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include2, 3, 5. ... 阅读全文
posted @ 2015-08-19 16:03 Chapter 阅读(140) 评论(0) 推荐(0) 编辑
摘要: 问题描述Given an absolute path for a file (Unix-style), simplify it.For example,path="/home/", =>"/home"path="/a/./b/../../c/", =>"/c"click to show corner... 阅读全文
posted @ 2015-08-18 15:33 Chapter 阅读(166) 评论(0) 推荐(0) 编辑
摘要: 问题描述Given a 2D board containing'X'and'O', capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that surrounded re... 阅读全文
posted @ 2015-08-18 14:50 Chapter 阅读(122) 评论(0) 推荐(0) 编辑