Beserious - 博客园

2017年7月24日

摘要： Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the dept 阅读全文

posted @ 2017-07-24 10:48 Beserious 阅读(123) 评论(0) 推荐(0) 编辑

2017年7月23日

108. Convert Sorted Array to Binary Search Tree

摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 给定有序数组构造二叉搜索树。考虑到二叉搜索树的性质（中序遍历二叉搜索树可以得到一个排序好的数组）构造的阅读全文

posted @ 2017-07-23 17:30 Beserious 阅读(108) 评论(0) 推荐(0) 编辑

2017年7月22日

107.Binary Tree Level Order Traversal II

摘要： Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For 阅读全文

posted @ 2017-07-22 17:29 Beserious 阅读(125) 评论(0) 推荐(0) 编辑

2017年7月21日

104. 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 node down to the farthest l 阅读全文

posted @ 2017-07-21 18:13 Beserious 阅读(108) 评论(0) 推荐(0) 编辑

101. Symmetric Tree

摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文

posted @ 2017-07-21 17:54 Beserious 阅读(114) 评论(0) 推荐(0) 编辑

100. 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 a 阅读全文

posted @ 2017-07-21 15:53 Beserious 阅读(121) 评论(0) 推荐(0) 编辑

88. Merge Sorted Array

摘要： Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size tha 阅读全文

posted @ 2017-07-21 15:29 Beserious 阅读(98) 评论(0) 推荐(0) 编辑

2017年7月20日

83. Remove Duplicates from Sorted List

摘要： Given a sorted linked list, delete all duplicates such that each element appear only once. For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, 阅读全文

posted @ 2017-07-20 19:08 Beserious 阅读(110) 评论(0) 推荐(0) 编辑

70. Climbing Stairs

摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文

posted @ 2017-07-20 18:05 Beserious 阅读(136) 评论(0) 推荐(0) 编辑

69. Sqrt(x)

摘要： Implement int sqrt(int x). Compute and return the square root of x. 二分可解这里是关于二分的一些总结：首先，如果题目属于"二分值越大越符合条件"，即要求符合条件的最小值，那就是while(r>l){mid=(l+r)/2。。。} 阅读全文

posted @ 2017-07-20 16:32 Beserious 阅读(120) 评论(0) 推荐(0) 编辑