LeetCode
-琥珀川-
奋斗吧 骚年!
展开
-
Maximal Square
Maximal Square ‘ Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing all 1’s and return its area. For example, given the following matrix: 1 0 1 0 0 1 0原创 2015-06-25 21:12:51 · 516 阅读 · 0 评论 -
Same Tree (判断树是否相等)
Same Tree Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value.原创 2015-06-25 21:44:13 · 687 阅读 · 0 评论 -
Binary Tree Postorder Traversal
Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3原创 2015-06-25 21:30:56 · 488 阅读 · 0 评论 -
Summary Ranges(数组中连续的数字段)
Summary Ranges Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return [“0->2”,”4->5”,”7”]. CODEpublic class Solution { pu原创 2015-06-26 11:53:18 · 832 阅读 · 0 评论 -
Count Complete Tree Nodes (求完全二叉树节点树)
Count Complete Tree Nodes Given a complete binary tree, count the number of nodes. Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly原创 2015-06-27 09:59:22 · 868 阅读 · 0 评论 -
Reverse Integer (数字反转)
Reverse Integer Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 陷阱 java int 的范围为 -2147483648->214748364710 如果超出则溢出 Code public class Solution {原创 2015-06-27 12:18:07 · 675 阅读 · 0 评论 -
Min Stack(返回栈中最小数)
Min Stack(返回栈中最小数)Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack.原创 2015-06-29 21:31:14 · 570 阅读 · 0 评论