2013年06月_martin_liang

转载 select系统调用源码分析

转自出处Linux 2.6.25中的select系统调用主要有4个函数, 层层分工明确: sys_select：处理时间参数，调用core_sys_select。 core_sys_select：处理三个fd_set参数，调用do_select。 do_select：做select/poll的工作。在合适的时机把自己挂起等待，调用sock_poll。 sock_

2013-06-18 23:35:38 2616

转载 Linux Epoll介绍和程序实例 .

转自出处 Linux Epoll介绍和程序实例1. Epoll是何方神圣？Epoll可是当前在Linux下开发大规模并发网络程序的热门人选，Epoll 在Linux2.6内核中正式引入，和select相似，其实都I/O多路复用技术而已，并没有什么神秘的。其实在Linux下设计并发网络程序，向来不缺少方法，比如典型的Apache模型（Process Per Connection，

2013-06-18 20:40:41 624

转载 HTTP 协议

转自出处HTTP协议详解当今web程序的开发技术真是百家争鸣，ASP.NET, PHP, JSP，Perl, AJAX 等等。无论Web技术在未来如何发展，理解Web程序之间通信的基本协议相当重要, 因为它让我们理解了Web应用程序的内部工作. 本文将对HTTP协议进行详细的实例讲解，内容较多，希望大家耐心看。也希望对大家的开发工作或者测试工作有所帮助。使用Fid

2013-06-09 13:51:46 574

原创 leetcode: Reverse Integer

Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321class Solution {public: int reverse(int x) { // Start typing your C/C++ solution below

2013-06-09 13:34:57 2725 1

转载 leetcode: Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,

2013-06-08 23:43:11 885

原创 leetcode: Climbing Stairs

You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?class Solution {pub

2013-06-06 18:33:12 697

转载 Java关键字final、static使用总结

转自出处Java关键字final、static使用总结一、final 根据程序上下文环境，Java关键字final有“这是无法改变的”或者“终态的”含义，它可以修饰非抽象类、非抽象类成员方法和变量。你可能出于两种理解而需要阻止改变：设计或效率。 final类不能被继承，没有子类，final类中的方法默认是final的。

2013-06-05 11:04:35 413

原创 leetcode: Permutations

Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].class Solutio

2013-06-04 14:39:41 707

原创 leetcode: Spiral Matrix II

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ]

2013-06-04 13:54:50 651

原创 leetcode: Plus One

Given a number represented as an array of digits, plus one to the number.class Solution {public: vector plusOne(vector &digits) { // Start typing your C/C++ solution below /

2013-06-04 00:09:38 756

原创 leetcode: Sort Colors

Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integer

2013-06-03 23:35:05 913

martin_liang的专栏