- 博客(16)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 200. Number of Islands
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume
2016-06-27 16:34:59
211
原创 SVN 命令行查询一段时间内log
SVN还可以使用版本日期来指定某个版本，日期格式使用ISO-8601标准，一般是yyyy-mm-dd hh:mm:ss。当你指定一个日期，SVN会在版本库中找到最接近这个日期的版本。 SVN对日期的解释是“之前最近”，因此，如果给出的时间只包含日期的话，例如2012-08-25，SVN会在2012-08-25 00:00:00这个时间点之前寻找，所以有可能会发生结果与预期不一致的情况，这个
2016-06-27 09:50:24
13085
1
原创 config.nmake 文件内容：
# $Id: config.nmake 47356 2013-01-29 21:37:48Z gerald $# Some more information about the settings in this file can be found in# the file README.windows and the Developer's Guide (available online).
2016-06-22 17:55:36
812
原创 275. H-Index II
Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?Subscribe to see which companies asked this question分析：H-index 我就是先排序
2016-06-18 23:24:03
182
原创 331. Verify Preorder Serialization of a Binary Tree
One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as#.
2016-06-18 16:36:35
200
原创 289. Game of Life
According to the Wikipedia's article: "The Game of Life, also known simply asLife, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."Given a board with m b
2016-06-18 14:14:56
163
原创 357. Count Numbers with Unique Digits
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.Example:Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x < 100, excludin
2016-06-18 11:33:35
468
原创 Wireshark-protobuf编译小结
需要进行抓包分析，由于不支持自定义协议，因此安排我来做wireshark的protobuf插件开发。wireshark 插件开发有两种，一种是用lua开发，挂在wireshark上。另一种是通过c插件编译出dll文件，将dll文件挂在wireshark上。软件版本：vs2008python 2.7protobuf 2.6.1wireshark 1.8.6主要
2016-06-16 18:32:15
3527
原创 148. Sort List
Sort a linked list in O(n log n) time using constant space complexity.Subscribe to see which companies asked this question分析：典型归并算法的实现。注意在判断mid时候映射mid>left,而不是mid>0；我在这个地方卡了好久。代码：/** *
2016-06-12 21:42:30
243
原创 313. Super Ugly Number
Write a program to find the nth super ugly number.Super ugly numbers are positive numbers whose all prime factors are in the given prime listprimes of size k. For example, [1, 2, 4, 7, 8, 13, 14,
2016-06-10 10:57:11
136
原创 318. Maximum Product of Word Lengths
Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case lett
2016-06-10 08:30:52
193
原创 122. Best Time to Buy and Sell Stock II
Say you have an array for which the ith element is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one
2016-06-09 11:32:45
163
原创 55. 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
2016-06-08 16:34:49
188
原创 121. Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),
2016-06-08 15:41:03
183
原创 349. Intersection of Two Arrays
Given two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return[2].Note:Each element in the result must be unique.The result c
2016-06-08 15:12:15
146
python xlrd3 安装包 用于python3以后的版本
2016-07-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人