ACwing 刷题 2022/3/17

40.顺时针打印矩阵

class Solution {
public:
    vector<int> printMatrix(vector<vector<int> > matrix) {
        vector<int> res;
        if(matrix.empty()) return res;
        int n=matrix.size(),m=matrix[0].size();
        vector<vector<bool>> st(n,vector<bool>(m,false));
        int dx[4]={-1,0,1,0};
        int dy[4]={0,1,0,-1};
        int x=0,y=0,d=1;
        for(int k=0;k<n*m;k++){
            res.push_back(matrix[x][y]);
            st[x][y]=true;
            int a=x+dx[d],b=y+dy[d];
            if(a<0||a>=n||b<0||b>=m||st[a][b]){
                d=(d+1)%4;
                a=x+dx[d];
                b=y+dy[d];
            }
            x=a;
            y=b;
        }
        return res;
    }
};

41.包含min函数的栈

class MinStack {
public:
    /** initialize your data structure here. */
    stack<int> stackValue;
    stack<int> stackMin;
    MinStack() {

    }

    void push(int x) {
        stackValue.push(x);
        if (stackMin.empty() || stackMin.top() >= x)
            stackMin.push(x);
    }

    void pop() {
        if (stackMin.top() == stackValue.top()) stackMin.pop();
        stackValue.pop();
    }

    int top() {
        return stackValue.top();
    }

    int getMin() {
        return stackMin.top();
    }
};

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack obj = new MinStack();
 * obj.push(x);
 * obj.pop();
 * int param_3 = obj.top();
 * int param_4 = obj.getMin();
 */

4306.序列处理

#include <bits/stdc++.h>
using namespace std;
int n, a[3010], ans;
unordered_map<int, int> m;
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    sort(a + 1, a + 1 + n);
    for (int i = n; i > 0; i--) {
        if (!m[a[i]]) {m[a[i]] = 1; continue;}
        while (m[a[i]]) ans++, a[i]++;
        m[a[i]] = 1;
    }
    printf("%d", ans);
    return 0;
}

4307.数字重构

tips：
1.如果数据发现过长的过不去，一定要想想换类型！！int——>long long
2. reverse函数的使用

reverse(numbera+1,numbera+la+1);
reverse(numberb+1,numberb+lb+1);

3.sort从大到小排序的使用

sort(numbera+1,numbera+la+1,greater<int>());

#include <bits/stdc++.h>
using namespace std;
int a,b,la,lb;
int numbera[20];
int numberb[20];
int ans[20],cnt[20];
bool solve(int u,int f){
	if(u>la) return 1;
	for(int i=9;i>=(u==1?1:0);i--){
		if((f&&i>numberb[u])||!cnt[i]) continue;
		cnt[i]--;
		ans[u]=i;
		if(solve(u+1,f&&i==numberb[u])) return 1;
		cnt[i]++;
	}
	return 0;
}
int main()
{
	cin>>a>>b;
	memset(cnt,0,sizeof(cnt));
	la=0,lb=0;
	la=0;
	while(a){
		numbera[++la]=a%10;
		a=a/10;
	}

	lb=0;
	while(b){
		numberb[++lb]=b%10;
		b=b/10;
	}
	
	for(int i=1;i<=la;i++)
		cnt[numbera[i]]++;
	if(la<lb){//比B数字位数少，直接输出即可 
		sort(numbera+1,numbera+la+1,greater<int>());
		for(int i=1;i<=la;i++)
			cout<<numbera[i];
		return 0;
	}
	reverse(numbera+1,numbera+la+1);
	reverse(numberb+1,numberb+lb+1);
	solve(1,1);
	for(int i=1;i<=la;i++)
		cout<<ans[i];
	return 0;
}