weixin_41811657的博客

本文将多任务学习作为多目标优化，总体目标是找到帕累托最优解。现有的MGDA（multiple-gradient descent algorithm）缺陷：(i) The underlying optimization problem does not scale gracefully to high-dimensional gradients, which arise naturally in deep networks.(ii) The algorithm requires explicit co

计算语义分割指标参考库medpy

Python 颜色表RGB颜色参考

Detectron2安装及使用Detectron2为facebook的开源目标检测检测框架，里面包含Faster R-CNN、Mask R-CNN等目标检测网络。安装使用Git命令下载detectron2文件：git clone https://github.com/facebookresearch/detectron2.git下载完成后，进入根目录下：cd detectron2然后运行：pip install -e .未完待续…...

剪切用 -ss 和 -t 选项， 从第 30 秒开始，向后截取 10 秒的视频，并保存：ffmpeg -i input.wmv -ss 00:00:30.0 -c copy -t 00:00:10.0 output.wmvffmpeg -i input.wmv -ss 30 -c copy -t 10 output.wmv也可以用 -ss 和 -to 选项， 从第 30 秒截取到第 40 秒：ffmpeg -i input.wmv -ss 30 -c copy -to 40 output.w

class Solution {public: ListNode* reverseList(ListNode* head) { ListNode* pre=nullptr; ListNode* cur=head; while(cur){ ListNode* next=cur->next; cur->next=pre; pre=cur; cur.

思路本题为动态规划，动态规划所求目标dp[i]为以元素nums[i]结尾的最大连续子序和;当dp[i-1]>0时，dp[i]=dp[i-1]+nums[i];当dp[i-1]$\leq$0时，dp[i]=nums[i];所以，状态转移方程为：dp[i]=max(0,dp[i−1])+nums[i]dp[i]=max(0,dp[i-1])+nums[i]dp[i]=max(0,dp[i−1])+nums[i]C++class Solution {public: int ma.

class Solution {public: int minSubArrayLen(int s, vector<int>& nums) { int j = 0, sum = 0, len = INT_MAX; for(int i = 0; i<nums.size(); i++) { sum += nums[i]; while(sum >= s) { len = min(len, i - j .

#include<iostream>#include<vector>using namespace std;class Solution {public: bool checkSubarraySum(vector<int>& nums, int k) { vector<int> presum(nums.size()); presum[0]=nums[0]; for(int i=1; .

#include<iostream>#include<vector>#include<unordered_map>using namespace std;class Solution {public: int subarraySum(vector<int>& nums, int k) { unordered_map<int, int> mymap; mymap[0]=1; .

# Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def removeElements(self, head: ListNode, val: int) -> ListNode: temp=List.

C++代码：class Solution {public: int removeDuplicates(vector<int>& nums) { int i=0, count=0, val=nums[0]; for (int j=0; j<nums.size(); j++){ if(nums[j]==val){ count++; } ..

#include<iostream>#include<vector>#include<algorithm>using namespace std;class Solution {private: vector<vector<int>> ans; vector<int> path;public: void backtracking(vector<int>& candidates,.

回溯算法三步法1. 确定递归函数参数  本题需要一维数组path来存放符合条件的结果，二维数组result来存放结果集。定义path 和 result为全局变量。接下来还需要如下参数：targetSum（int）目标和，也就是题目中的n。k（int）就是题目中要求k个数的集合。sum（int）为已经收集的元素的总和，也就是path里元素的总和。startIndex（int）为下一层for循环搜索的起始位置。代码:vector<vector<int>> re.