Atlas-Zzz

摘要： http://oj.leetcode.com/problems/convert-sorted-list-to-binary-search-tree/Example:Input: Linked List 1->2->3Output: A Balanced BST 2 / \ ... 阅读全文

摘要： You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ... 阅读全文

摘要： Original Blog:http://leetcode.com/2011/03/median-of-two-sorted-arrays.html#comment-1053 阅读全文

摘要： Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu... 阅读全文

摘要： Reverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321Have you thought about this?Here are some good questions to ask... 阅读全文

摘要： 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 an... 阅读全文

摘要： Definition: see wikihttp://en.wikipedia.org/wiki/Binary_search_tree 1 /* 2 This look up is a fast operation because you eliminate the half 3 t... 阅读全文

摘要： 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 le... 阅读全文

摘要： Single NumberGiven an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runti... 阅读全文

摘要： Note: this is copied from my google doc, the format isweirdBe able to describe how different virtual memory schemes are implemented, including base an... 阅读全文