题目：
Roman numerals come from the ancient Roman numbering system. They are based on specific letters of the alphabet which are combined to signify the sum (or, in some cases, the difference) of th...
分类：
其他好文 时间：
2014-06-20 12:27:09
阅读次数：
394
Ajax请求默认的都是异步的如果想同步 async设置为false就可以（默认是true）var
html = $.ajax({ url: "some.jsp", async: false}).responseText;
或者在全局设置Ajax属性$.ajaxSetup({ async: false...
分类：
其他好文 时间：
2014-06-11 12:55:08
阅读次数：
198
reference:https://projects.drogon.net/raspberry-pi/wiringpi/functions/Functions
(API)Some of the functions in theWiringPilibrary are designed to mimic...
Description
Farmer John wants the cows to prepare for the county jumping competition, so Bessie and the gang are practicing jumping over hurdles. They are getting tired, though, so they want to be ...
分类：
其他好文 时间：
2014-06-08 15:55:10
阅读次数：
199
题目
Given a string S and a string T, count the number of distinct subsequences of T in S.
A subsequence of a string is a new string which is formed from the original string by deleting some (can be...
分类：
其他好文 时间：
2014-06-08 14:49:14
阅读次数：
347
Happy Number
Accepted : 110
Submit : 263
Time Limit : 1000 MS
Memory Limit : 65536 KB
Problem Description
Recently, Mr. Xie learn the concept of happy numb...
分类：
移动开发 时间：
2014-06-08 05:44:33
阅读次数：
264
Suppose a sorted array is rotated at some pivot
unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are
given a target value t...
分类：
其他好文 时间：
2014-06-08 02:05:43
阅读次数：
311
Problem 1: Ski Lessons [Brian Jacokes,
2002]Farmer John wants to take Bessie skiing in Colorado. Sadly, Bessieis not
really a very good skier.Bessie h...
分类：
其他好文 时间：
2014-06-08 01:30:57
阅读次数：
406
Problem 1: Gifts [Kalki Seksaria and Brian
Dean, 2012]Farmer John wants to give gifts to his N (1 2 #include 3 #include 4
#include 5 #include 6 ...
分类：
其他好文 时间：
2014-06-08 00:46:18
阅读次数：
613
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 i...
分类：
其他好文 时间：
2014-06-08 00:33:42
阅读次数：
339
