果粒陈33

分类

题解(23)

/ 注册

全部文章（共16篇）

题解 | #合并两个排序的链表#

# def __init__(self, x): # self.val = x # self.next = None # # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @param pHead1 ListNode类...

Python3 Python2

2022-06-26

0 299

题解 | #反转链表#

# class ListNode: # def __init__(self, x): # self.val = x # self.next = None # # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @para...

Python3 Python2

2022-06-23

0 345

题解 | #二叉树中和为某一值的路径(一)#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

Python3 Python2 二叉树

2022-06-22

0 331

题解 | #买卖股票的最好时机 ii#

# # # @param prices int整型一维数组 # @return int整型 # class Solution: def maxProfit(self , prices ): # write code here profit = 0 ...

Python2 Python3

2022-06-20

1 418

题解 | #买卖股票的最好时机(一)#

# # # @param prices int整型一维数组 # @return int整型 # class Solution: def maxProfit(self , prices ): # write code here # 动态规划 ...

Python2 Python3

2022-06-20

0 292

题解 | #判断链表中是否有环#

# class ListNode: # def __init__(self, x): # self.val = x # self.next = None # # # @param head ListNode类 # @return bool布尔型 # cl...

Python2 Python3

2022-06-20

0 345

题解 | #求二叉树的前序遍历#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param root TreeN...

Python2 Python3

2022-06-20

0 400

题解 | #访问单个节点的删除#

# -*- coding:utf-8 -*- # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Remove: def removeN...

Python2 Python3

2022-06-20

0 485

题解 | #另类加法#

# -*- coding:utf-8 -*- class UnusualAdd: def addAB(self, A, B): # write code here while B: C = A ^ B B = ...

Python2 Python3

2022-06-20

0 423

题解 | #词频统计#

# -*- coding:utf-8 -*- class Frequency: def getFrequency(self, article, n, word): # write code here n = 0 for s in articl...

Python2 Python3

2022-06-20

0 341