摘要：
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999. 阅读全文
摘要：
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
Note: You may not slant the container and n is at least 2. 阅读全文
摘要：
Implement regular expression matching with support for '.' and '*'. 阅读全文
摘要：
socket编程中listen函数分析 阅读全文
摘要：
socket编程中connect函数分析 阅读全文
摘要：
Determine whether an integer is a palindrome. Do this without extra space. 阅读全文
摘要：
Implement atoi to convert a string to an integer.
Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.
Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front. 阅读全文
摘要：
Reverse digits of an integer. 阅读全文
摘要：
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) 阅读全文
摘要：
TCP/IP详解卷一，从入门到放弃。实在坚持不下去了，本来都准备换书了，结果今天头条面试又问到了TCP相关内容。
那就再坚持一下吧。把TCP相关内容，做一个简单的整理吧。算是读书笔记，毕竟只看书不记点什么的话，容易犯困。。 阅读全文