2013年9月12日

[leetcode.com]算法题目 - 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. 1 阅读全文

posted @ 2013-09-12 21:11 Horstxu 阅读(260) 评论(0) 推荐(0) 编辑

[leetcode.com]算法题目 - Pascal's Triangle

摘要: GivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]] 1 class Solution { 2 public: 3 vector > generate(int numRows) { 4 // Start typing your C/C++ solution below 5 // DO NOT write in... 阅读全文

posted @ 2013-09-12 20:53 Horstxu 阅读(179) 评论(0) 推荐(0) 编辑

导航