【144-Binary Tree Postorder Traversal（二叉树非递归后序遍历）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 Given a binary tree, return the postorder traversal of its nodes’ values.
For example:
Given binary tree {1,...
分类：
编程语言 时间：
2015-08-19 08:15:55
阅读次数：
207
【139-Word Break（单词拆分）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary wo...
分类：
编程语言 时间：
2015-08-19 07:06:04
阅读次数：
528
【137-Single Number II（只出现一次的数字II）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm sh...
分类：
编程语言 时间：
2015-08-18 07:56:07
阅读次数：
249
【138-Copy List with Random Pointer（拷贝有随机指针的单链表）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 A linked list is given such that each node contains an additional random pointer which could point to any node in t...
分类：
编程语言 时间：
2015-08-18 07:55:06
阅读次数：
164
题目： 3 个数和问题
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...
分类：
其他好文 时间：
2015-08-16 18:25:29
阅读次数：
173
题目：与3数和最接近的和
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would...
分类：
其他好文 时间：
2015-08-16 18:25:25
阅读次数：
126
【129-Sum Root to Leaf Numbers（所有根到叶子结点组组成的数字相加）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example...
分类：
编程语言 时间：
2015-08-15 06:44:54
阅读次数：
114
【134-Gas Station（加油站问题】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 There are N gas stations along a circular route, where the amount of gas at station i is gas[i].
You have a car with an unlimited gas tan...
分类：
编程语言 时间：
2015-08-15 06:44:26
阅读次数：
147
【120-Triangle（三角形）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, giv...
分类：
编程语言 时间：
2015-08-14 07:38:58
阅读次数：
283
题目：阿拉伯数字转罗马数字Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.原题链接地址：https://leetcode.com/problems/integer-to-roman/
分析：题意将阿拉伯数字num转罗马数字
拼写...
分类：
其他好文 时间：
2015-08-13 20:10:49
阅读次数：
129
