04 2016 档案
摘要:关于二叉树的遍历在面试时是企业经常容易考到的题目,这里做一下总结。 各类二叉树遍历的概念 二叉树有前序遍历,中序遍历和后序遍历三种。关于这三种遍历,网上资料有很多,在此就不做详细介绍了。主要需要记住顺序: 前序遍历 - 根->左->右 中序遍历 - 左->根->右 后序遍历 - 左->右->根 递归
阅读全文
摘要:题目: Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive. Range sum S(i, j) is defined as the sum of the
阅读全文
摘要:题目: Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible represen
阅读全文
摘要:题目: 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
阅读全文
摘要:近日参加了一家国内某知名互联网公司的在线笔试,有一道算法题比较有意思,拿出来分享一下。 题目: 给定一个字符串,可以随意删除字符串里的任何字符(也可以不删除),目标是删除一些字符后让剩下的字符能够组成回文,并返回该输入字符串所能构成的最长回文长度。 例如,输入:"eabbfa"。 删除e和f后,构成
阅读全文
摘要:题目: Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums
阅读全文
摘要:题目: Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains
阅读全文