- 博客(6)
- 收藏
- 关注
RSS订阅转载 归并排序 MergeSort
def mergeSort(arry,left,right): if left < right: mid = (left + right) / 2 mergeSort(arry,left,mid) mergeSort(arry,mid+1,right) mergeArry(arry,left,right,mid) return arry def mergeArry(arry
2015-08-16 11:14:23
269
转载 快速排序 QuickSort
def adjustArry(arry,left,right): i = left j = right x = arry[i] while i < j: while i= x: j-=1 if arry[j] < x: arry[i] = arry[j] i+=1 while i<j and arry[i] <= x: i+=1 if arry[
2015-08-11 17:02:31
258
原创 LeetCode #27 Remove Element
class Solution: # @param {integer[]} nums # @param {integer} val # @return {integer} def removeElement(self, nums, val): size = 0 for i in range(0,len(nums)):
2015-08-05 17:07:19
226
原创 LeetCode #26 Remove Duplicates from Sorted Array
class Solution: # @param {integer[]} nums # @return {integer} def removeDuplicates(self, nums): if len(nums) == 0: return 0 if len(nums) == 1: retur
2015-08-05 16:31:08
228
转载 LeetCode #22 Generate Parentheses
class Solution: # @param {integer} n # @return {string[]} def generateParenthesis(self, n): left = right = n s = '' sset = set() self.parentGen(s,left,righ
2015-08-05 12:01:29
247
原创 LeetCode #21 Merge Two Sorted Lists
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: # @param {ListNode} l1 # @param {ListNode
2015-08-04 21:37:18
231
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人