import socketdictlist ={};def ReadHost(): hosts = []; obn = open('d:/sss.txt', 'rb'); for line in obn: #sometime you should filter \r\...
分类：
其他好文 时间：
2014-06-28 21:53:30
阅读次数：
234
WHAT?主要思想：子程序不应因传入参数错误而被破坏WHY?保护程序免遭非法输入的破坏HOW?断言assert denominator != 0 : "denominator should not be 0"; // 启动VM时需要 -ea 参数用以启动assert功能只用于开发、维护阶段用错误处理...
分类：
其他好文 时间：
2014-06-28 20:11:37
阅读次数：
274
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu...
分类：
其他好文 时间：
2014-06-21 09:18:50
阅读次数：
263
len is a build-in function that returns the numbers of characters in a string: Since we started counting at zero, the last index should be 5...
分类：
其他好文 时间：
2014-06-21 08:17:22
阅读次数：
243
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Def...
分类：
其他好文 时间：
2014-06-21 07:55:42
阅读次数：
197
题目
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the...
分类：
其他好文 时间：
2014-06-18 12:05:44
阅读次数：
244
题目
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use only const...
分类：
其他好文 时间：
2014-06-18 11:53:39
阅读次数：
138
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu...
分类：
其他好文 时间：
2014-06-18 10:17:40
阅读次数：
174
题目
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
If the number of nodes is not a multiple of k then left-out nodes in the end should rem...
分类：
其他好文 时间：
2014-06-17 22:15:52
阅读次数：
299
开放封闭原则（Open Closed Principle）表述为 "软件实体（类、模块、函数等）应对扩展开放，但对修改封闭。（Software entities (classes, modules, functions, etc.) should be open for extension, but...
分类：
其他好文 时间：
2014-06-17 21:14:56
阅读次数：
268
