## 《Linux网络编程》随记之第一章网络编程概述 & 第二章TCP/IP协议

http://blog.ihuxu.com/note-of-the-network-programming文章来源：胡小旭 => 《Linux网络编程》随记之第一章网络编程概述 & 第二章TCP/IP协议 Read More

## [LeetCode]Two Sum

ProbleDetermine whether an integer is a palindrome. Do this without extra space.Some hints[code lang="shell" collapse="true"Could negative integers be palindromes? (ie, -1If you are thinking of converting the integer to string, note the restriction of using extra space.You could also try reversing an integer. However, if you have solved the problem "Reverse Integer", you know that th... Read More

## [LeetCode]Roman to Integer

ProbleGiven a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.IdeaFinding the Law of Changing Roman Numbers into Arabic Numbers。Solutio[code lang="cpp"class Solution publicint romanToInt(string s) int l = s.length(), a = 0;for (int i = 0; i < l; ++iif (i < l - 1 && char2int(s[i]) < char2int(s[i + 1])) a -= char2int(s[i]);} else a += char2int(s[i]);... Read More

## 关于int的取值范围（有种背下来）

unsigned int 0～429496729int -2147483648～214748364unsigned long 0～429496729long -2147483648～214748364long long的最大值：922337203685477580long long的最小值：-922337203685477580unsigned long long的最大值：184467440737095516__int64的最大值：922337203685477580__int64的最小值：-922337203685477580unsigned __int64的最大值：1844674407370955161原文链接：http://blog.csdn.net/niuox/article/details/823194 Read More