These general semantic segmentation methods mainly focus on multi-scale context modeling, ignoring the special issues

Recent advances in Graph Convolutional Neural Networks (GCNNs) have shown their efficiency for nonEuclidean data on gr

论文链接As the labeling process is tedious and labor intensive, developing algorithms that can adapt source ground truth l

单调栈Leetcode 84柱状图中的最大矩形 找到每个柱形条左边和右边最近的比自己低的矩形条，然后用宽度乘上当前柱形条的高度作为备选答案。 此类问题的经典做法是单调栈，维护一个单调递增的栈，如果当前柱形条i 的高度比栈顶要低，则栈顶元素

class ListNode: def __init__(self, x): self.val = x self.next = None 92反转链表2pre:开始反转的前一个节点 cur:原链表当前

遍历unordered_map leetcode 49字母异位词分组 class Solution { public: vector groupAnagrams(vector& strs) {