摘要: Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 题意:根据中序遍历和后序 阅读全文
posted @ 2017-02-19 22:00 Pacific-hong 阅读(125) 评论(0) 推荐(0) 编辑
摘要: Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文
posted @ 2016-11-21 08:41 Pacific-hong 阅读(107) 评论(0) 推荐(0) 编辑
摘要: 79. Word Search QuestionEditorial Solution My Submissions 79. Word Search QuestionEditorial Solution My Submissions QuestionEditorial Solution Total A 阅读全文
posted @ 2016-11-14 14:19 Pacific-hong 阅读(160) 评论(0) 推荐(0) 编辑
摘要: Curling 2.0 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18680 Accepted: 7661 Description On Planet MM-21, after their Olympic games thi 阅读全文
posted @ 2016-10-19 22:39 Pacific-hong 阅读(86) 评论(0) 推荐(0) 编辑
摘要: Meteor Shower Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16508 Accepted: 4331 Description Bessie hears that an extraordinary meteor sh 阅读全文
posted @ 2016-10-19 22:31 Pacific-hong 阅读(271) 评论(0) 推荐(0) 编辑
摘要: 100. Same Tree QuestionEditorial Solution My Submissions 100. Same Tree QuestionEditorial Solution My Submissions QuestionEditorial Solution Total Acc 阅读全文
posted @ 2016-10-14 23:09 Pacific-hong 阅读(92) 评论(0) 推荐(0) 编辑
摘要: 题目描述: Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 思路: 不能用除法,只能想到减法,但是结果最大可能是-INT_M 阅读全文
posted @ 2016-08-27 22:34 Pacific-hong 阅读(90) 评论(0) 推荐(0) 编辑
摘要: Implement regular expression matching with support for '.' and '*'. 阅读全文
posted @ 2016-08-07 17:29 Pacific-hong 阅读(71) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=1008 水题,直接转换就好,稍微注意一点的是,一组输入输出,用到链表。 Code: 阅读全文
posted @ 2016-07-06 20:11 Pacific-hong 阅读(103) 评论(0) 推荐(0) 编辑
摘要: C++编程语言是一款应用广泛,支持多种程序设计的计算机编程语言。它的继承、重载、多态等特性为其自身镀上了一层层神秘的色彩,这也是为什么C++精彩的原因,如今,众多语言模仿C++的特性,更说明了这样的性质的独特之处,我们今天就会为大家详细介绍其中C++多态性的一些基本知识,以方便大家在学习过程中对此能 阅读全文
posted @ 2016-06-09 10:50 Pacific-hong 阅读(137) 评论(0) 推荐(0) 编辑