- 博客(17)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to it
2014-11-14 20:48:37
397
原创 Leetcode--Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to
2014-11-14 13:59:01
440
原创 Leetcode--Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if yo
2014-11-13 13:35:18
443
原创 Leetcode--Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once in the combinati
2014-11-13 12:29:48
552
原创 Leetcode--Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative. Hide Tags Math String
2014-11-12 14:13:51
787
原创 C++ 对象模型 第一章 关于对象
补充： 全局变量 （所有文件可见） 静态全局变量（当前文件可见） 局部变量（当前Scope可见） 类的继承关系中的虚继承（virtual）就是共享的意思 、纯虚函数：只能用于继承，它的实现留给该基类的派生类去做。 内联函数（inline function）在计算机中，内联函数是一种程序语言结构，用来建议编译器对一些特殊函数进行内联扩展；也就是说建议编译器将指定的函数体插
2014-11-10 10:40:06
455
原创 UDP 用户数据报协议、DNS 域名系统
OSI 七层协议 1）应用层：直接为用户的应用进程提供服务 2）传输层：两个主机进程之间的通信提供服务 a)TCP：面向连接的，数据传输的单位是报文段，能够提供可靠的交付 b)UDP：无连接的，数据传输的单位是用户数据报，只能提供“尽最大努力交付” 3）网络层：“分组”和“数据报” 4）数据链路层：数据链路层将网络层交下来的IP数据报组装成帧和必要的控制信息 5）
2014-11-10 10:20:06
1516
原创 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 ], [
2014-11-05 19:44:36
438
原创 Spiral Matrix
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example, Given the following matrix: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ] You
2014-11-05 15:17:01
484
原创 Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of t
2014-11-05 10:28:39
376
原创 Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Note: Given m, n satisfy the follo
2014-11-04 11:19:48
396
原创 TCP的交互式数据流、TCP的成块数据流、TCP超时和重传、TCP坚持定时器、TCP保活定时器
TCP的交互式数据流 1)经受时延的确认 TCP的交互式数据流通常使用“经过时延的确认”技术。通常服务器在接收到从客户端发送过来的数据时，并不马上发送ACK，而是等一小段时间，看看本机是否有数据要反馈给客户端，如果 有，就将数据包含在此ACK包中，一起发送给Client。一般情况下这个时延为200ms。需要注意的时这个200ms的定时器时相对于内核的时钟滴答的。如果一个数据分
2014-11-04 10:34:25
1025
原创 Leecode--Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. click to show follow up. Follow up: Did you use extra space? A straight forward solution using O(mn) s
2014-11-02 14:45:18
638
原创 Leetcode--Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log n). If the target is not found in t
2014-11-01 20:53:48
453
原创 Unique Paths II
Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 respectively in the grid
2014-11-01 14:26:50
355
原创 Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach the bo
2014-11-01 14:05:27
388
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人