22. 括号生成
给出 n 代表生成括号的对数,请你写出一个函数,使其能够生成所有可能的并且有效的括号组合。
例如,给出 n = 3,生成结果为:
[ "((()))", "(()())", "(())()", "()(())", "()()()" ]
class Solution:
def generateParenthesis(self, n):
s = []
self.generator(n,0,0,'',s)
return s
def generator(self,n,left,right,ret,s):
if right == n:
if ret not in s:
s.append(ret)
return
if left < n:
self.generator(n,left + 1,right,ret + '(',s)
if right < left:
self.generator(n,left,right + 1,ret + ')',s)
23. 合并K个排序链表
合并 k 个排序链表,返回合并后的排序链表。请分析和描述算法的复杂度。
示例:
输入: [ 1->4->5, 1->3->4, 2->6 ] 输出: 1->1->2->3->4->4->5->6
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def mergeTwoLists(self, l1, l2):
head = ListNode(0)
a = head
while l1 != None and l2 != None:
if(l1.val <= l2.val):
b = ListNode(l1.val)
l1 = l1.next
else:
b = ListNode(l2.val)
l2 = l2.next
a.next = b
a = a.next
if l1 == None:
a.next = l2
else:
a.next = l1
return head.next
def mergeLists(self,start,end,s):
if start < end:
mid = int((start + end)/2)
a = self.mergeLists(start,mid,s)
b = self.mergeLists(mid + 1,end,s)
return self.mergeTwoLists(a,b)
else:
return s[start]
def mergeKLists(self,lists):
if lists == []:
return None
return self.mergeLists(0, len(lists) - 1,lists);
24. 两两交换链表中的节点
给定一个链表,两两交换其中相邻的节点,并返回交换后的链表。
示例:
给定1->2->3->4
, 你应该返回2->1->4->3
.
说明:
- 你的算法只能使用常数的额外空间。
- 你不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
-
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def swapPairs(self, head): newhead = ListNode(0) newhead.next = head a = newhead b = head while b != None: if b.next != None: a.next = b.next b.next = b.next.next a.next.next = b a = a.next a = a.next b = a.next else: b = b.next return newhead.next