LiBlog

2014年11月22日

Leetcode-Find Minimum in Rotated Sorted Array II

摘要： Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose a s... 阅读全文

posted @ 2014-11-22 04:10 LiBlog 阅读(136) 评论(0) 推荐(0) 编辑

Leetcode-Find Minimum in Rotated Sorted Array

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

posted @ 2014-11-22 04:07 LiBlog 阅读(125) 评论(0) 推荐(0) 编辑

Leetcode-Reverse Nodes in k-Group

摘要： Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then le... 阅读全文

posted @ 2014-11-22 04:05 LiBlog 阅读(138) 评论(0) 推荐(0) 编辑

2014年11月21日

Leetcode-Longest Valid Parentheses

摘要： Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the lon... 阅读全文

posted @ 2014-11-21 12:27 LiBlog 阅读(156) 评论(0) 推荐(0) 编辑

Leetcode-Search in Rotated Sorted Array

摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target valu... 阅读全文

posted @ 2014-11-21 11:27 LiBlog 阅读(170) 评论(0) 推荐(0) 编辑

Leetcode-Generate Parentheses

摘要： Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((... 阅读全文

posted @ 2014-11-21 05:41 LiBlog 阅读(170) 评论(0) 推荐(0) 编辑

Leetcode-Swap Nodes in Pairs

摘要： Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your al... 阅读全文

posted @ 2014-11-21 05:23 LiBlog 阅读(129) 评论(0) 推荐(0) 编辑

Leetcode-Search for a range

摘要： Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文

posted @ 2014-11-21 05:06 LiBlog 阅读(112) 评论(0) 推荐(0) 编辑

Leetcode-Combinations Sum II

摘要： Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each numb... 阅读全文

posted @ 2014-11-21 04:40 LiBlog 阅读(161) 评论(0) 推荐(0) 编辑

Leetcode-Combination Sum

摘要： Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeate... 阅读全文

posted @ 2014-11-21 04:04 LiBlog 阅读(162) 评论(0) 推荐(0) 编辑

公告