http://www.cppblog.com/sleepwom/archive/2010/07/08/119746.html一、X.509数字证书的编码X.509证书的结构是用ASN1(Abstract
Syntax Notation One)进行描述数据结构，并使用ASN1语法进行编码。ASN1采...
分类：
其他好文 时间：
2014-05-27 02:51:56
阅读次数：
335
You Should Fall In Love With Someone Who
InspiresYouFEB. 5, 2014BySTEPHANIE ALTHOFThere’s one trait that I continuously
find myself coming back to whe...
分类：
其他好文 时间：
2014-05-24 07:45:20
阅读次数：
264
One Person GameTime Limit:2 Seconds Memory
Limit:65536 KBThere is an interesting and simple one person game. Suppose there
is a number axis under your...
分类：
其他好文 时间：
2014-05-24 07:02:17
阅读次数：
310
About Self-Signed Certificates
自签证书。一个SSL证书，是加密网站的信息，并创建更安全的链接的一种方式。附加地，证书可以给网站浏览者显示VPS的的身份证明信息。如果一个SSC没有第三方证实，那么证书作者可以发行SSL证书，用以验证虚拟服务器的细节。
Step One-...
分类：
其他好文 时间：
2014-05-19 15:53:09
阅读次数：
262
DescriptionIn order to get from one of the F (1
2 and 1 –> 6 –> 5 –> 21 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6
–> 5 –> 43 – 7: 3 –> 4 –> 7 and 3 –> 2 –> 5 ....
分类：
其他好文 时间：
2014-05-19 12:43:06
阅读次数：
200
Problem Description
Speedcell and Shoutmon love triangles very much.One day,they are playing a game named “Triangle Counting”.
In this game,Speedcell draws a round,and draws N points on the circum...
分类：
其他好文 时间：
2014-05-18 14:19:00
阅读次数：
262
【题目】
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
For example, given array S = {...
分类：
其他好文 时间：
2014-05-18 10:37:57
阅读次数：
269
Singles' Day
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld
& %llu
Submit Status
Description
Singles' Day(or One's Day), an unofficial holiday in China, is a p...
分类：
其他好文 时间：
2014-05-18 09:29:15
阅读次数：
301
【题目】
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
【题意】
合并K个有序链表
【思路】
归并
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
For ...
分类：
其他好文 时间：
2014-05-18 09:05:40
阅读次数：
255
3SumClosest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution....
分类：
其他好文 时间：
2014-05-18 05:57:48
阅读次数：
244
