JSRGFJZ6 - 博客园

摘要：题目：Say you have an array for which the ith element is the price of a given stock on day i.Design a... 阅读全文

posted @ 2015-10-11 16:45 JSRGFJZ6 阅读(89) 评论(0) 推荐(0) 编辑

摘要：题目：Implement atoi to convert a string to an integer.思路：一路走下去注意最大值最小值代码：class Solution {public://ht... 阅读全文

posted @ 2015-10-11 13:22 JSRGFJZ6 阅读(106) 评论(0) 推荐(0) 编辑

摘要：题目：There are N gas stations along a circular route, where the amount of gas at station i is gas[i]... 阅读全文

posted @ 2015-10-11 13:13 JSRGFJZ6 阅读(124) 评论(0) 推荐(0) 编辑

摘要：题目：Now, instead outputting board configurations, return the total number of distinct solutions.思路：... 阅读全文

posted @ 2015-10-11 00:01 JSRGFJZ6 阅读(113) 评论(0) 推荐(0) 编辑

摘要：题目：Given a digit string, return all possible letter combinations that the number could represent. ... 阅读全文

posted @ 2015-10-08 20:35 JSRGFJZ6 阅读(125) 评论(0) 推荐(0) 编辑

摘要：题目：The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two qu... 阅读全文

posted @ 2015-10-07 07:44 JSRGFJZ6 阅读(120) 评论(0) 推荐(0) 编辑

摘要：题目：The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 11... 阅读全文

posted @ 2015-10-07 07:39 JSRGFJZ6 阅读(179) 评论(0) 推荐(0) 编辑

摘要：题目：Given a collection of candidate numbers (C) and a target number (T), find all unique combinatio... 阅读全文

posted @ 2015-10-07 00:39 JSRGFJZ6 阅读(126) 评论(0) 推荐(0) 编辑

摘要：题目：Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C... 阅读全文

posted @ 2015-10-06 00:04 JSRGFJZ6 阅读(116) 评论(0) 推荐(0) 编辑

摘要：题目：Given n pairs of parentheses, write a function to generate all combinations of well-formed pare... 阅读全文

posted @ 2015-10-05 23:56 JSRGFJZ6 阅读(107) 评论(0) 推荐(0) 编辑

Jean