丶Blank - 博客园

2015年4月23日

摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the... 阅读全文

posted @ 2015-04-23 16:37 丶Blank 阅读(169) 评论(0) 推荐(0) 编辑

Remove Linked List Elements——LeetCode

摘要： Remove all elements from a linked list of integers that have valueval.ExampleGiven:1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6,val= 6Return:1 --> 2 --> 3 --... 阅读全文

posted @ 2015-04-23 12:54 丶Blank 阅读(132) 评论(0) 推荐(0) 编辑

Maximum Subarray——LeetCode

摘要： 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 @ 2015-04-23 11:27 丶Blank 阅读(132) 评论(0) 推荐(0) 编辑

2015年4月22日

Validate Binary Search Tree——LeetCode

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

posted @ 2015-04-22 22:40 丶Blank 阅读(289) 评论(0) 推荐(0) 编辑

Swap Nodes in Pairs——LeetCode

摘要： 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 @ 2015-04-22 16:27 丶Blank 阅读(139) 评论(0) 推荐(0) 编辑

Find Minimum in Rotated Sorted Array——LeetCode

摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文

posted @ 2015-04-22 12:08 丶Blank 阅读(181) 评论(0) 推荐(0) 编辑

Linked List Cycle——LeetCode

摘要： Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?题目大意：给定一个链表，判断是否有环？解题思路：解法一：快慢指针，如果有环，那么快慢... 阅读全文

posted @ 2015-04-22 10:33 丶Blank 阅读(168) 评论(0) 推荐(0) 编辑

Happy Number——LeetCode

摘要： Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer... 阅读全文

posted @ 2015-04-22 10:11 丶Blank 阅读(880) 评论(0) 推荐(0) 编辑

2015年4月21日

Binary Tree Zigzag Level Order Traversal——LeetCode

摘要： 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 @ 2015-04-21 21:47 丶Blank 阅读(152) 评论(0) 推荐(0) 编辑

Construct Binary Tree from Preorder and Inorder Traversal——LeetCode

摘要： Given preorder and inorder traversal of a tree, construct the binary tree.题目大意：给定一个二叉树的前序和中序序列，构建出这个二叉树。解题思路：跟中序和后序一样，在先序中取出根节点，然后在中序中找到根节点，划分左右子树，递归构... 阅读全文

posted @ 2015-04-21 15:42 丶Blank 阅读(143) 评论(0) 推荐(0) 编辑

似水流年。

快看，我要变身了。

公告