LeetCode Single Number DescriptionGiven an array of integers, every element appears twice except for one. Find that single one. Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi 6月 24 2015 #leetcode
LeetCode Min Stack DescriptionDesign 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. top( 6月 24 2015 #leetcode
LeetCode Reverse Linked List DescriptionReverse a singly linked list. The original problem is here. The original code is here. 6月 23 2015 #leetcode
LeetCode Intersection of Two Linked Lists DescriptionThe original problem is here. The original code is here. 6月 22 2015 #leetcode
LeetCode Invert Binary Tree Descriptionnvert a binary tree. 4 / 2 7 / \ / 1 3 6 9to 4 / 7 2 / \ / 9 6 3 1 The original problem is here. The original code is here. 6月 22 2015 #leetcode
LeetCode Symmetric Tree DescriptionGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: 1 / 2 2 / \ / 3 4 4 3But the follow 6月 22 2015 #leetcode
LeetCode Plus One DescriptionGiven a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. The original pr 6月 21 2015 #leetcode
LeetCode Same Tree DescriptionGiven 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. The o 6月 21 2015 #leetcode
LeetCode Ppalindrome Number DescriptionGiven a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in pl 6月 21 2015 #leetcode
LeetCode Remove Nth Node From End Of List DescriptionGiven a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node 6月 20 2015 #leetcode