![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法题
qq_28285625
这个作者很懒,什么都没留下…
展开
-
leetcode226-反转二叉树
public class TreeNode { public var val: Int public var left: TreeNode? public var right: TreeNode? public init() { self.val = 0; self.left = nil; self.right = nil; } public init(_ val: Int) { self.val = val; self.left = nil; self..原创 2021-12-08 13:10:25 · 170 阅读 · 0 评论 -
Leetcode206-反转链表
public class ListNode { public var val: Int public var next: ListNode? public init() { self.val = 0; self.next = nil; } public init(_ val: Int) { self.val = val; self.next = nil; } public init(_ val: Int, _ next: ListNode?) { sel..原创 2021-12-08 11:59:51 · 626 阅读 · 0 评论 -
leetcode110-平衡二叉树
着实有点抽象 public class TreeNode { public var val: Int public var left: TreeNode? public var right: TreeNode? public init() { self.val = 0; self.left = nil; self.right = nil; } public init(_ val: Int) { self.val = val; self.left = n原创 2021-12-07 22:17:46 · 161 阅读 · 0 评论 -
求两个view的最近公共父类
首先,这个问题必然不能按照常规的方式去对一个VIew的所有父类去进行for循环比较,那这个题出的就没有意义。再,每个类的所有父类组成了一个继承链,而在UIKit下,所有的UIView的最终父类也必然是NSObject,其实就相当于这两个类的继承链从NSObject开始向下一直是重合的,直到最后的一个公共父类才开始分开,这个最后的公共父类也是最近的公共父类,这是典型的倒Y字型链表组合。那么解题思路就很好做了,具体代码如下:func getCommonRoot(view1: UIView?,view2:原创 2021-12-07 00:25:41 · 2179 阅读 · 0 评论 -
leetcode第100题同一颗树
public class TreeNode { public var val: Int public var left: TreeNode? public var right: TreeNode? public init() { self.val = 0; self.left = nil; self.right = nil; } public init(_ val: Int) { self.val = val; self.left = nil; sel...原创 2021-12-06 16:06:21 · 75 阅读 · 0 评论 -
二叉树层序遍历(swift)
public class TreeNode { public var val: Int public var left: TreeNode? public var right: TreeNode? public init() { self.val = 0; self.left = nil; self.right = nil; } public init(_ val: Int) { self.val = val; self.left = nil; self..原创 2021-12-05 14:23:48 · 2045 阅读 · 0 评论 -
对称二叉树
struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right;};BOOL isSymmetric1(struct TreeNode* root){ return isMirror(root, root);}BOOL isMirror(struct TreeNode *t1,struct TreeNode *t2){ if(t1 == nil && t2 =.原创 2021-12-03 00:01:53 · 283 阅读 · 0 评论