2016年03月_别哔哔好伐

07月 06月 04月 03月 01月

原创 leetcode-338-Counting Bits

338. Counting Bits Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.

2016-03-19 11:09:40 1455

原创利用JPcap进行抓包

JPCAP实际上并非一个真正去实现对数据链路层的控制，而是一个中间件，JPCAP调用wincap/libpcap，而给JAVA语言提供一个公共的接口，从而实现了平台无关性。在官方网站上声明，JPCAP支持FreeBSD 3.x, Linux RedHat 6.1, Fedora Core 4, Solaris, and Microsoft Windows 2000/XP等系统。参考

2016-03-14 22:05:04 7971 4

原创 leetcode-189.-Rotate Array

Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Note: Try to come up as many solutions as

2016-03-09 20:58:19 271

原创 leetcode-328-Odd Even Linked List

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes. You should try to do it in

2016-03-07 22:46:05 291

原创计算机网络

1>.当一个IP数据报封装成链路层的帧时，此数据报的总长度（即报头区加上数据部分）一定不能超过下层的数据链路层的MTU值，否则无法传输。因此，我们需要对IP包进行分片，其中IP数据报的首部中，和IP数据包分片有关的字段为——总长度、标识、标志以及位偏移.分片由网络层的路由器完成。目的主机收到所有分片后，对分片进行重新组装还原的过程叫做IP

2016-03-06 14:50:51 290

原创 leetcode-257-Binary Tree Paths

Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: ["1->2->5", "1->3"] 输出所有从根

2016-03-03 11:29:29 279

原创 leetcode-88-Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: Yo u may assume that nums1 has enough space (size that is greater or equal to m +

2016-03-02 18:11:32 274

原创 leetcode-26-Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with

2016-03-02 16:49:54 262