2014年11月11日
摘要: 1.(原文)问题描述Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,... 阅读全文
posted @ 2014-11-11 15:27 叼烟斗的纤夫 阅读(236) 评论(0) 推荐(0) 编辑
摘要: 1.(原文)问题描述Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".click to show clarif... 阅读全文
posted @ 2014-11-11 14:32 叼烟斗的纤夫 阅读(235) 评论(0) 推荐(0) 编辑
摘要: 1.原文问题描述:Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -... 阅读全文
posted @ 2014-11-11 12:59 叼烟斗的纤夫 阅读(227) 评论(0) 推荐(0) 编辑