![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
剑指offer
Yif_Zhou
这个作者很懒,什么都没留下…
展开
-
二维数组的查找
class Solution: def findNumberIn2DArray(self, matrix: List[List[int]], target: int) -> bool: if matrix: column, row = len(matrix[0]) - 1, 0 while column >= ...原创 2020-02-11 23:37:02 · 136 阅读 · 0 评论 -
两个栈实现堆
class CQueue: def __init__(self): self.inner = [] self.outer = [] def appendTail(self, value: int) -> None: self.inner.append(value) def deleteHead(self) -> ...原创 2020-02-11 23:17:14 · 329 阅读 · 0 评论 -
从尾到头打印链表
class Solution: def reversePrint(self, head: ListNode) -> List[int]: if not head: return [] root = self.reverseLink(head) cur = root res = [] ...原创 2020-02-11 23:15:57 · 61 阅读 · 0 评论 -
二叉树镜像
class Solution: def mirrorTree(self, root: TreeNode) -> TreeNode: if not root: return None root.left, root.right = root.right, root.left self.mirrorTree(...原创 2020-02-11 23:11:29 · 117 阅读 · 0 评论 -
翻转链表
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def reverseList(self, head: ListNode) -> ...原创 2020-02-11 20:55:42 · 84 阅读 · 0 评论