xchangcheng - 博客园

2014年3月11日

摘要： Write a function to find the longest common prefix string amongst an array of strings.Solution:class Solution {public: string longestCommonPrefix(vector &strs) { int len = 0, n = strs.size(), MaxL = 0; if(n == 0) return ""; else if(n == 1) return strs[0]; for(i... 阅读全文

posted @ 2014-03-11 10:04 xchangcheng 阅读(174) 评论(0) 推荐(0)

2014年3月10日

[LeetCode] Partition List

摘要： Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the original relative order of the nodes in each of the two partitions.For example,Given1->4->3->2->5->2andx= 3,return1->2->2->4->3- 阅读全文

posted @ 2014-03-10 23:38 xchangcheng 阅读(349) 评论(0) 推荐(0)

[LeetCode] Triangle

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,5,7], [4,1,8,3]]The minimum path sum from top to bottom is11(i.e.,2+3+5+1= 11).Note:Bonus point if you are a... 阅读全文

posted @ 2014-03-10 21:01 xchangcheng 阅读(354) 评论(0) 推荐(0)

[LeetCode] Unique Paths II

摘要： Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as1and0respectively in the grid.For example,There is one obstacle in the middle of a 3x3 grid as illustrated below.[ [0,0,0], [0,1, 阅读全文

posted @ 2014-03-10 20:34 xchangcheng 阅读(196) 评论(0) 推荐(0)

[LeetCode] Jump Game

摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you are able to reach the last index.For example:A =[2,3,1,1,4], returntrue.A =[3,2,1,0,4], returnfalse.So 阅读全文

posted @ 2014-03-10 20:09 xchangcheng 阅读(119) 评论(0) 推荐(0)

[LeetCode] Longest Consecutive Sequence

摘要： Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given[100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is[1, 2, 3, 4]. Return its length:4.Your algorithm should run in O(n) complexity.Solution:class Solution {public: set... 阅读全文

posted @ 2014-03-10 19:31 xchangcheng 阅读(145) 评论(0) 推荐(0)

[LeetCode] Path Sum II

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum = 22, 5 / \ 4 8 / / \ 11 13 4 / \ / \ 7 2 5 1return[ [5,4,11,2]... 阅读全文

posted @ 2014-03-10 16:16 xchangcheng 阅读(121) 评论(0) 推荐(0)

2014年3月9日

[LeetCode] Length of Last Word

摘要： Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word does not exist, return 0.Note:A word is defined as a character sequence consists of non-space characters only.For example,Givens="Hello Worl 阅读全文

posted @ 2014-03-09 22:39 xchangcheng 阅读(230) 评论(0) 推荐(0)

[LeetCode] Spiral Matrix II

摘要： Given an integern, generate a square matrix filled with elements from 1 ton2in spiral order.For example,Givenn=3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ]]Solution:class Solution {public: int **used; vector > generateMatrix(int n) { vector > ans; ... 阅读全文

posted @ 2014-03-09 21:42 xchangcheng 阅读(255) 评论(0) 推荐(0)

[LeetCode] Trapping Rain Water

摘要： Trapping Rain WaterGivennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example,Given[0,1,0,2,1,0,1,3,2,1,2,1], return6.The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In thi 阅读全文

posted @ 2014-03-09 18:50 xchangcheng 阅读(182) 评论(0) 推荐(0)

Andy Shaw

公告