2016年09月_millyn13

09月 08月 07月 06月 05月 04月 03月 02月 01月

转载 TCP---三次握手和四次挥手

本文转载自：http://blog.csdn.net/renzhenhuai/article/details/12105457 一、TCP报文格式 TCP/IP协议的详细信息参看《TCP/IP协议详解》三卷本。下面是TCP报文格式图：图1 TCP报文格式上图中有几个字段需要重点介绍下：（1）序号：Seq序号，占

2016-09-17 13:23:04 271

原创 Leetcode-sqrt

题目描述 Implementint sqrt(int x). Compute and return the square root of x. public class Solution { public int sqrt(int x) { long start = 1; long end = x; wh

2016-09-16 23:45:39 260

原创动态规划几个典型题总结

这是典型的三道动态规划，在笔试当中，有可能会被举一反三地考。 1、求一个数组最大连续子数组之和。示例：int[] nums = {2,1,3,6,-10,5}; 最大连续子数组是2,1,3,6，所以输出12。 2、求一个数组的最长递增子序列。示例：int[] nums = {2,1,3,6,-10,5}; 最长递增子序列是1,3,6，所以输出3。

2016-09-11 15:11:38 665

原创 Leetcode-interleaving-string

题目描述 Given s1, s2, s3, find whether s3 is formed by the interleaving of s1and s2. For example, Given: s1 ="aabcc", s2 ="dbbca", When s3 ="aadbbcbcac", return true. When s3 ="aad

2016-09-04 18:33:22 328

原创 Leetcode-distinct-subsequences

题目描述 Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from the original string by deleting

2016-09-04 16:52:04 325

原创 Leetcode-longest-substring-without-repeating-characters

题目描述 Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the l

2016-09-03 23:11:05 210