package leetcode func findSubsequences(nums []int) [][]int { c, visited, res := []int{}, map[int]bool{}, [][]int{} for i := 0; i < len(nums)-1; i++ { if _, ok := visited[nums[i]]; ok { continue } else { visited[nums[i]] = true generateIncSubsets(nums, i,...
packageleetcodeimport("sort")// 解法一 DP O(n^2) 思路是仿造最长上升子序列的思路funceraseOverlapIntervals(intervals[][]int)int{iflen(intervals)==0{return0}sort.Sort(Intervals(intervals))dp,res:=make([]int,len(intervals)),0fori:=rangedp{dp[i]=1}fori:=1;i<len(intervals);i++{forj...