最近开始复习python的使用，把服务器运维常用的模块的用法进行了实例化概述。==========sort=========================
python排序；
ls=[1,31,13,141,41]
ls.sort()
printls
元组sort：
>>>lst=[(‘wyl‘,24),(‘hjj‘,25),(‘zs‘,22),(‘lisi‘,14)]
>>>sorted(l..
分类：
编程语言 时间：
2014-12-07 06:50:43
阅读次数：
232
Search in Rotated Sorted Array IIFollow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity...
分类：
其他好文 时间：
2014-12-06 19:32:52
阅读次数：
173
Search in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2)....
分类：
其他好文 时间：
2014-12-06 19:23:29
阅读次数：
195
Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, r...
分类：
其他好文 时间：
2014-12-06 17:59:20
阅读次数：
116
Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.类似归并排序，对于lists[0, n-1]，先对list[0,1], list[2, 3], ... li...
分类：
其他好文 时间：
2014-12-06 17:59:16
阅读次数：
181
题目
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.
解答
法1：从表头开始一个个比较...
分类：
其他好文 时间：
2014-12-06 16:54:53
阅读次数：
126
题目
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.
解答
注意假的头结点的运用，代码如下：
/**
* Definition for singly-...
分类：
其他好文 时间：
2014-12-06 16:51:45
阅读次数：
195
Remove Duplicates from Sorted List IIGiven a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the or...
分类：
其他好文 时间：
2014-12-06 16:48:45
阅读次数：
170
本文是在学习中的总结，欢迎转载但请注明出处：http://blog.csdn.net/pistolove/article/details/41750865
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.
For example,
Given 1->2->3,4->5->6,...
分类：
其他好文 时间：
2014-12-06 08:55:36
阅读次数：
245
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-12-06 08:53:46
阅读次数：
155
