MemoryFraction

Leetcode link: https://leetcode.com/problems/balanced-binary-tree/Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined asa bin

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must not contain

原题链接：https://leetcode.com/problems/merge-two-sorted-lists/思路:0  处理边界条件1  两个输入链表可能为空，采用dummy节点，使得dummy.next指向新链表的第一个节点。2  初始化时，使用两个指针指向两个链表的表头，两个指针同时不为空时，取较小的节点放入新链表的尾部。3  然后把链表

原题：https://leetcode.com/problems/longest-substring-without-repeating-characters/Given a string, find the length of the longest substring without repeating characters.Examples:Given "abca

链接：https://leetcode.com/problems/min-stack/题目要求：Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stac

题目：https://leetcode.com/problems/binary-tree-level-order-traversal/九章算法答案：http://www.jiuzhang.com/solutions/binary-tree-level-order-traversal/思路：Queue使用时要尽量避免Collection的add()和remove()方

https://leetcode.com/problems/linked-list-cycle/《进军硅谷》类似题目：环的长度题目：给出一个单向链表头指针，如果有环，判断环的长度，否则返回0；思路：1 判断链表是否有环。 使用快慢指针，如果快指针已经到尾部，而且他们没有相遇，则无环；如果他们相遇，则有环2 上图为例：慢指针：9->8->7->1;

题目：https://leetcode.com/problems/count-primes/题目要求：输出比一个非负数字N小的prime的个数；质数，百度百科：http://baike.baidu.com/view/10626.htm素数：　是只有两个正因子（1和自己）的自然数；最小的素数是２；合数：　比1大但不是素数的数称之为合数；０和１不是素数也不是合数；IsPrime

https://leetcode.com/problems/intersection-of-two-linked-lists/Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two lin

判断 Linked List是否属于回文思路：迭代法+快慢指针快指针是慢指针速度的两倍；1 while循环，fast到tail，slow只到一半；2 slow内容均迭代放入stack3 如果linkedlist元素个数是奇数(fast!=null), slow需要前移1 位4 然后对比stack 的顶元素与slow指针指向的内容；  不等-> 返回false； 相等

原题链接：https://leetcode.com/problems/valid-anagram/Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat

原题：https://leetcode.com/problems/reverse-linked-list/内容：Reverse a singly linked list.A linked list can be reversed either iteratively or recursively. Could you implement both?总思路图：

1 有序数组去重给出有序数组，就地移除重复元素，保证无重复，并返回新数组长度；举例：已知：A=[1,1,2,3,3]  输出长度3，  A=[1,2,3]思路图： public static int RemoveDuplicate(int[] arr) { if (arr == null || arr.Length ==

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element

Given an integer, write a function to determine if it is a power of three.Follow up:Could you do it without using any loop / recursion?问题：判断是否是3的幂？思路：递归java代码：public class Solution

You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint t

Successor: write an algorithm to find the "next" node(i.e. in-order successor) of a given node in a binary search tree. you may assume that each node has a link to its parent已知BST中的一个node， 写算法找到下一个节

https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/题目大意：已知一个BST，找到BST中的节点p+q的最小公共祖先；思路：递归1 boundary conditions: tree, p, q任意为null， 返回null2 如果p.va, q.val均小于root.val ->

原题：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/题目大意：已知一个BT，找到BST中的节点p+q的最小公共祖先；例子：        _______3______       /              \    ___5__          ___1__   / 

https://leetcode.com/problems/validate-binary-search-tree/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

原题链接：https://leetcode.com/problems/add-two-numbers/给出两个整数，每个整数由一个链表表示。其中链表每个节点保存数的数位，这些数位反序存在链表中，即高位在最后，低位在最前面。返回一个链表代表这两个数之和。举例，如图：思路：由于反序存储在链表中，可以从表头开始顺序相加；两个链表长度不同，如何相加链表而没有剩余

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.Subscribe to see w

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 leaf node.思路：递归java语言/** * De

Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input ca

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all valid bu

Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st

《进军硅谷》原题：合并有序数组给定两个有序数组A和B， 合并B到A， 结果保持有序。假设A有足够空间容纳B。初始时，A、B元素各有m和n个；分析：数组插入新元素没有链表那么方便，因为插入一个新元素会导致插入后的所有元素的移动，为了避免移动，通常从后向前插入，即反向插入；思路：1 找到原有数组A和B的最后一个元素；2 逐个把较大的值放在A数组的m+n-1位置向

原题链接：https://leetcode.com/problems/two-sum/已知条件：Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input

排列组合子集合 subset(medium)输入一个含有不同数字的序列，输出所有可能的集合（含空集）。要求1 集合里元素有序排列;2 输出结果不含有重复集合;举例：输入{1,2,3], 输出{},{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}原题：https://leetcode.com/problems/subsets/思路图：Amor