剑指offer
Parallax_2019
初极狭,才通人。复行数十步,豁然开朗。----T
展开
-
从尾到头打印链表-剑指offer
# -*- coding:utf-8 -*-# class ListNode: #指的是每一个点的数值# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: # 返回从尾部到头部的列表值序列,例如[1,2,3] def print...原创 2019-04-23 18:58:13 · 63 阅读 · 0 评论 -
二维数组的查找
# -*- coding:utf-8 -*-"""用row和col两参数逐行或逐列遍历数组"""class Solution: # array 二维列表 def Find(self, target, array): # write code here rows = len(array)#首先确定数组的维度 cols = le...原创 2019-05-08 17:31:11 · 192 阅读 · 0 评论 -
链表倒数第k个节点
# -*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = None"""双指针的关键是如何保持指针的距离为k-1"""class Solution: def FindKthToTail(self, head, k...原创 2019-05-06 18:33:54 · 58 阅读 · 0 评论 -
链表反转
# -*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = None"""pHead指针通过其.next属性将原链表上next_指针前移,pre指针指向反转后的片段,并通过pre指针用反转后的片段接到\npHead具有一个新节...原创 2019-05-07 02:34:37 · 78 阅读 · 0 评论 -
合并两个排序的链表
# -*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: # 返回合并后列表 def Merge(self, pHead1, pHead2): # wr...原创 2019-05-07 05:09:24 · 83 阅读 · 0 评论 -
链表相交的第一个节点
# -*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = None"""首先判断长度,然后移动指针将两个链表尾部对齐,当两链表的头指针相等时,即为交点"""class Solution: def FindFirst...原创 2019-05-07 19:57:11 · 249 阅读 · 0 评论 -
链表中环的入口节点
# -*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def EntryNodeOfLoop(self, pHead): # write code here...原创 2019-05-07 21:37:11 · 74 阅读 · 0 评论 -
删除链表中重复(数字域)的节点
# -*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = None"""没有三个指针解决不了的问题"""class Solution: def deleteDuplication(self, pHead):##最好...原创 2019-05-08 02:18:27 · 174 阅读 · 0 评论