dp经典题题目
Given a string S and a string T, count the number of distinct subsequences of T in S....
分类：
其他好文 时间：
2015-02-13 18:37:37
阅读次数：
167
https://oj.leetcode.com/problems/letter-combinations-of-a-phone-number/Given a digit string, return all possible letter combinations that the number c...
分类：
其他好文 时间：
2015-02-13 18:20:16
阅读次数：
119
判断是否数字，考虑多种情况
class Solution{
public:
bool isNumber(string s){
int i = 0;
while(s[i] == ' ') ++i;
while(s[i] == '+' || s[i] == '-') ++i;
bool exp = false, space = false, point = fa...
分类：
其他好文 时间：
2015-02-13 16:38:49
阅读次数：
97
标题：Maximum Subarray通过率：34.5%难度：中等Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, ...
分类：
其他好文 时间：
2015-02-13 13:02:34
阅读次数：
162
required: "必选字段", remote: "请修正该字段", email: "请输入正确格式的电子邮件", url: "请输入合法的网址", date: "请输入合法的日期", dateISO: "请输入合法的日期 (ISO).", number: "请输入合法的数字", digits: ...
分类：
其他好文 时间：
2015-02-13 13:01:30
阅读次数：
187
Wormholes
Description
While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to it...
分类：
其他好文 时间：
2015-02-13 11:41:25
阅读次数：
145
Given string A representative a positive integer which has N digits, remove any k digits of the number, the remaining digits are arranged according to the original order to become a new positive integer....
分类：
其他好文 时间：
2015-02-13 11:39:14
阅读次数：
119
存储过程中调用存储过程create or replace package body PF_Role_Pack is procedure sp_GetPage_Role(pageSize_ in number, --每页大小 pageIndex_ ...
分类：
数据库 时间：
2015-02-13 10:04:45
阅读次数：
185
The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of ...
分类：
其他好文 时间：
2015-02-13 09:21:11
阅读次数：
155
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon...
分类：
其他好文 时间：
2015-02-13 09:13:59
阅读次数：
127
