剑指Offer-35-复杂链表的复制

2020-10-22 2026-09-20

Coding / 剑指Offer / 35

6 minutes read (About 971 words)

题目

题目描述

请实现 copyRandomList 函数，复制一个复杂链表。在复杂链表中，每个节点除了有一个 next 指针指向下一个节点，还有一个 random 指针指向链表中的任意节点或者 null。

Algorithm, DFS, Offer, 二叉树, 递归

剑指Offer-34-二叉树中和为某一值的路径

2020-10-22 2026-09-20

Coding / 剑指Offer / 34

2 minutes read (About 374 words)

题目

题目描述

输入一棵二叉树和一个整数，打印出二叉树中节点值的和为输入整数的所有路径。从树的根节点开始往下一直到叶节点所经过的节点形成一条路径。

Algorithm, DFS, Offer, 二叉树, 递归

剑指Offer-33-二叉搜索树的后序遍历序列

2020-10-20 2026-09-20

Coding / 剑指Offer / 33

4 minutes read (About 674 words)

题目

题目描述

输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历结果。如果是则返回 true，否则返回 false。假设输入的数组的任意两个数字都互不相同。

Algorithm, Offer, 栈, 递归

CANet

2020-10-20 2026-09-20

CV / Few-Shot Segmentation / CANet

3 minutes read (About 503 words)

CANet(CANet: Class-Agnostic Segmentation Networks with Iterative Refinement and Attentive Few-Shot Learning)[1] consists of a two-branch dense comparison module which performs multi-level feature comparison, and an iterative optimization module which iteratively refines the predicted results. There are some details of reading and implementing it.

CANet, DL, FSS

SG-One

2020-10-20 2026-09-20

CV / Few-Shot Segmentation / SG-One

3 minutes read (About 483 words)

SG-One(SG-One: Similarity Guidance Network for One-Shot Semantic Segmentation)[1] adopt a masked average pooling strategy for producing the guidance features, then leverage the cosine similarity to build the relationship. There are some details of reading and implementing it.

DL, FSS, SG-One

co-FCN

2020-10-19 2026-09-20

CV / Few-Shot Segmentation / co-FCN

2 minutes read (About 306 words)

co-FCN(Conditional Networks for Few-Shot Semantic Segmentation)[1] handle sparse pixel-wise annotations to achieve nearly the same accuracy. There are some details of reading and implementing it.

DL, FSS, co-FCN

剑指Offer-35-复杂链表的复制

题目

题目描述

剑指Offer-34-二叉树中和为某一值的路径

题目

题目描述

剑指Offer-33-二叉搜索树的后序遍历序列

题目

题目描述

CANet

SG-One

co-FCN

Tag Cloud

Categories

Recent

Archives

Recent

Archives

Your browser is out-of-date!