2021-12-5

https://github.com/kirito66465/ManageSystem

https://segmentfault.com/a/1190000019418065

807. 保持城市天际线

class Solution {
public:
    int maxIncreaseKeepingSkyline(vector<vector<int>>& grid) {
		int n=grid.size();
        vector<int> maxr(n);
		vector<int> maxc(n);
		int ans=0;
        //遍历得到每行每列的最大值
		for(int i=0;i<n;++i){
			for(int j=0;j<n;++j){
				maxr[i]=max(grid[i][j],maxr[i]);
				maxc[j]=max(grid[i][j],maxc[j]);
			}
		} 
        //min取得每个建筑的最大高度，减原高度求和就是答案
		for(int i=0;i<n;++i){
			for(int j=0;j<n;++j){
				ans+=min(maxr[i],maxc[j])-grid[i][j];
			}
		} 
		return ans;
    }
};

https://blog.csdn.net/LZW15082682930/article/details/114979947

https://blog.csdn.net/qq_36725282/article/details/105286459

https://blog.csdn.net/cui_yonghua/article/details/92806957

#include<iostream>
using namespace std;
int hh(int n){
	return n*n;
}
int main(){
	hh(2);
	return 0;
} 

https://zhidao.baidu.com/question/453903592.html

851. 喧闹和富有

class Solution {
public:
	vector<int> ans;
	vector<vector<int>> hash;
    vector<int> q;
	int dfs(int i){
		if(ans[i]!=-1) return ans[i];//记忆化搜素，如果更新过就直接用
		else ans[i]=i;
		for(auto h:hash[i]){
			if(q[dfs(h)]<q[ans[i]]){
				ans[i]=dfs(h);
			}
		}
		return ans[i];
	}
    vector<int> loudAndRich(vector<vector<int>>& richer, vector<int>& quiet) {
		q=quiet;
		int n=q.size();
		ans=vector<int>(n,-1);
		hash=vector<vector<int>>(n);
		for(auto r:richer){//r[0]>r[1]
			hash[r[1]].push_back(r[0]);
		}
		for(int i=0;i<n;++i){
			dfs(i);
		}
		return ans;
    }
};

iota(ans.begin(), ans.end(), 0);

emplace/push

拓扑排序方法，如果用邻接矩阵好像能够优化

class Solution {
public:
    vector<int> loudAndRich(vector<vector<int>> &richer, vector<int> &quiet) {
        int n=quiet.size();
		vector<vector<int>> hash(n);
		vector<int> in(n,0);//入度数组
		vector<int> ans(n); 
		//反向遍历，类似哈希收集各点及其下游点
		for(auto r:richer){
			hash[r[0]].push_back(r[1]);
			++in[r[1]];
		} 
		//将answer[i]初始化为i
		for(int i=0;i<n;++i){
			ans[i]=i;
		}
		//拓扑排序，利用队列插入入度为0的点，循环更新 
		queue<int> q;
		for(int i=0;i<n;++i){
			if(in[i]==0){
				q.push(i);
			}
		}
		while(!q.empty()){
			int t=q.front();
			q.pop();
			for(int h:hash[t]){
				//用答案来比较，避免重复运算 
				if(quiet[ans[t]]<quiet[ans[h]]){
					ans[h]=ans[t];
				}
				if(--in[h]==0){
					q.push(h);
				} 
			}
		}
		return ans;	
    }
};