LeetCode
发条毛虫
喜爱coding 开源爱好
展开
-
container-with-most-water(最大蓄水问题)
题目描述: Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin原创 2016-09-11 17:09:19 · 1583 阅读 · 0 评论 -
maximum-depth-of-binary-tree(二叉树的最大深度)
maximum-depth-of-binary-tree(二叉树的最大深度)题目:maximum-depth-of-binary-tree Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root nod原创 2016-09-07 20:55:45 · 1263 阅读 · 0 评论 -
palindrome-number(回文数)
题目描述 Determine whether an integer is a palindrome. Do this without extra space.(确定的整数是否为回文。做到这一点没有额外的空间。) click to show spoilers.(单击显示剧透)不知道spoilers翻译对不? Some hints: Could negative integers be pa原创 2016-09-10 22:18:40 · 686 阅读 · 0 评论 -
reverse-integer(反转整型)
题目描述Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here are some good questions to ask before codi原创 2016-09-26 20:32:14 · 3771 阅读 · 0 评论 -
Isomorphic Strings(同构字符串)
题目描述 Given two strings s and t, determine if they are isomorphic. Two strings are isomor- phic if the characters in s can be replaced to get t. For example,”egg” and “add” are isomorphic, “foo”原创 2016-09-28 19:07:18 · 657 阅读 · 0 评论 -
Evaluate Reverse Polish Notation(评估逆波特兰表示法)
题目描述 Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are+,-,*,/. Each operand may be an integer or another expression. Some examples: [“2”, “1”,原创 2016-09-26 20:58:16 · 467 阅读 · 0 评论