摘要： C语言代码编程规范http://wenku.baidu.com/link?url=Whbur-Ovmy1DpX93XH71bsQh8LQ720hNh-lI5duFCGYhqL0BdXkMkLL_cn7_PSHuRxmeNw50QeKgOBVBGm1wWzdEv22f6crZCfY1TqiQhoi代码风格http://baike.baidu.com/link?url=2UxVrv-BwGF72QYTJYccZr79xKsT-c6lPOFNCWUBH5FvS7ZsG-sMYKWXCYk_-KLnZJX9KrAO4gwXZGVLyydv-qC语言编码风格和标准http://tonybai.com/2 阅读全文

摘要： http://bbs.csdn.net/topics/390526352 阅读全文

摘要： http://blog.sina.com.cn/s/blog_7b519a6b0101ah3h.html 阅读全文

摘要： sudo apt-get install lamp-server^ 阅读全文

摘要： 最靠谱 Centos6.4 64位 U盘安装攻略 阅读全文

摘要： map的应用输入n(n map = new HashMap();28 for (int i = 0, len = arr.length; i = 0; --i) {35 System.out.print(" " + map.get(newArr[i]));36 }37 System.out.println();38 }39 }View Code 阅读全文

摘要： 也就是一月份是0，以此类推。 阅读全文

摘要： 2000 1 import java.util.Scanner; 2 3 public class Main { 4 public static void main(String[] args) { 5 Scanner in = new Scanner(System.in); 6 while (in.hasNext()) { 7 String s = in.next(); 8 char c1 = s.charAt(0); 9 char c2 = s.charAt(1);10 ... 阅读全文

摘要： There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 阅读全文

摘要： http://leetcode.com/onlinejudge#question_1 Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based. You may assume that each input would have exactly one solution. Input: numbers={2, 7, 11, 15}, target=9 Output: index1=1, index2= 阅读全文