2014年6月6日
leetcode--Maximum Subarray
摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,... 阅读全文
posted @ 2014-06-06 09:45 Averill Zheng 阅读(129) 评论(0) 推荐(0) 编辑
leetcode--Climbing Stairs
摘要： You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb... 阅读全文
posted @ 2014-06-06 08:18 Averill Zheng 阅读(155) 评论(0) 推荐(0) 编辑
leetcode--Search Insert Position
摘要： Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or... 阅读全文
posted @ 2014-06-06 05:15 Averill Zheng 阅读(130) 评论(0) 推荐(0) 编辑
leetcode--Best Time to Buy and Sell Stock III
摘要： Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2014-06-06 05:03 Averill Zheng 阅读(176) 评论(0) 推荐(0) 编辑
leetcode--Best Time to Buy and Sell Stock II
摘要： Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2014-06-06 02:50 Averill Zheng 阅读(160) 评论(0) 推荐(0) 编辑
leetcode--Best Time to Buy and Sell Stock
摘要： Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文
posted @ 2014-06-06 02:35 Averill Zheng 阅读(133) 评论(0) 推荐(0) 编辑
leetcode--Reverse Integer
摘要： Reverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321click to show spoilers.Have you thought about this?Here are som... 阅读全文
posted @ 2014-06-06 00:47 Averill Zheng 阅读(107) 评论(0) 推荐(0) 编辑
2014年6月5日
leetcode--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 an... 阅读全文
posted @ 2014-06-05 23:08 Averill Zheng 阅读(114) 评论(0) 推荐(0) 编辑
leetcode--Binary Tree Level Order Traversal II
摘要： Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2014-06-05 11:40 Averill Zheng 阅读(139) 评论(0) 推荐(0) 编辑
leetcode--Binary Tree Zigzag Level Order Traversal
摘要： Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文
posted @ 2014-06-05 11:20 Averill Zheng 阅读(159) 评论(0) 推荐(0) 编辑
leetcode--Remove Duplicates from Sorted Array II
摘要： Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =[1,1,1,2,2,3],Your function should ret... 阅读全文
posted @ 2014-06-05 10:35 Averill Zheng 阅读(119) 评论(0) 推荐(0) 编辑
leetcode--Binary Tree Level Order Traversal
摘要： Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文
posted @ 2014-06-05 10:11 Averill Zheng 阅读(134) 评论(0) 推荐(0) 编辑
leetcode--Merge Sorted Array
摘要： Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal... 阅读全文
posted @ 2014-06-05 09:45 Averill Zheng 阅读(182) 评论(0) 推荐(0) 编辑
leetcode--Populating Next Right Pointers in Each Node II
摘要： Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文
posted @ 2014-06-05 08:33 Averill Zheng 阅读(154) 评论(0) 推荐(0) 编辑
leetcode--Populating Next Right Pointers in Each Node
摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2014-06-05 03:43 Averill Zheng 阅读(143) 评论(0) 推荐(0) 编辑
leetcode--Swap Nodes in Pairs
摘要： Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文
posted @ 2014-06-05 03:16 Averill Zheng 阅读(147) 评论(0) 推荐(0) 编辑
leetcode--Rotate List
摘要： Given a list, rotate the list to the right bykplaces, wherekis non-negative.For example:Given1->2->3->4->5->NULLandk=2,return4->5->1->2->3->NULL./** *... 阅读全文
posted @ 2014-06-05 02:53 Averill Zheng 阅读(169) 评论(0) 推荐(0) 编辑
leetcode--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 le... 阅读全文
posted @ 2014-06-05 01:53 Averill Zheng 阅读(153) 评论(0) 推荐(0) 编辑
leetcode--Add Binary
摘要： Given two binary strings, return their sum (also a binary string).For example,a ="11"b ="1"Return"100".public class Solution { /**The program is us... 阅读全文
posted @ 2014-06-05 01:08 Averill Zheng 阅读(186) 评论(0) 推荐(0) 编辑
leetcode--Two Sum
摘要： 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... 阅读全文
posted @ 2014-06-05 00:28 Averill Zheng 阅读(186) 评论(0) 推荐(0) 编辑