面试必备代码模板

 

#include <iostream>
#include <string>
#include <vector>
using namespace std;

int main() {
    //int a;
    //cin >> a;
    vector<vector<int>> a;
    vector<vector<int>> b;
    vector<vector<int>> c;

    freopen("A", "r", stdin);//打开文件（“文件路径”，“读”，“输入流”）
    int a1,a2,a3,b1,b2;
    
    while(cin>>a1>>a2>>a3)
    {
        a.push_back({a1,a2,a3});
    }
    fclose(stdin);
    
    freopen("B", "r", stdin);
    freopen("C", "w", stdout);
    while(cin>>b1>>b2)
    {
        b.push_back({b1,b2});
    }
    for(int i=0;i<a.size();i++)
    {
        for(int j=0;j<b.size();j++)
        if(a[i][1] == b[j][1])
            cout<<a[i][0]<<' '<<a[i][1]<<' '<<a[i][2]<<' '<<b[j][0]<<endl;
    }
    fclose(stdin);
    fclose(stdout);
    return 0;

}

https://blog.csdn.net/Hollake/article/details/100642464

求n中，从1~n中相加等于n的组合有多少（递归+回溯）

void dg(int x, int sum, int target, vector<int> &path)
{
	if (sum == target)
	{
		res.push_back(path);
		return;
	}
	for (int i = x; i <= target - sum; ++i)
	{
		path.push_back(i);
		dg(i+1, sum + i, target, path);
		path.pop_back();
	}
}

//求1~n中，和为target的组合
void dg(int x, int sum, int n,int target, vector<int> &path)
{
	if (sum == target)
	{
		res.push_back(path);
		return;
	}
	for (int i = x; i <= min(n,target-sum); ++i)
	{
		path.push_back(i);
		dg(i+1, sum + i, n,target, path);
		path.pop_back();
	}
}

class Singleton
{
public:
	static Singleton& getInstence()//传引用
	{
		static Singleton instance;//局部静态变量，仅被初始化一次，线程安全
		return instance;
	}
private:
	Singleton(){};//构造函数私有化
	Singleton(const Singleton& other);//拷贝构造函数私有化
};

int main()
{
	Singleton &a = Singleton::getInstence();
	return 0;
}

//滑窗匹配
int left = 0, right = 0;

while (right < s.size()) {`
    // 增大窗口
    window.add(s[right]);
    right++;
    
    while (window needs shrink) {
        // 缩小窗口
        window.remove(s[left]);
        left++;
    }
}

KMP 字符串匹配

void getnext(vector<int> &next, string t)
{
	next[0] = -1;
	int lent = t.size();
	int j = 0, k = -1;
	while (j < lent-1)// lent-1
	{
		if (k == -1 || t[j] == t[k])
		{
			j++; k++;
			next[j] = k;
		}
		else
			k = next[k];
	}
}
vector<vector<int> > ans;//找到所有的匹配字符串

void kmp(string s, string t)
{
	int lens = s.size(), lent = t.size();
	vector<int> next(lent);
	
	getnext(next, t);
	int i = 0;

    int j = 0; //初始化j为0
	while (i < lens && j < lent)
	{
	    if (j == -1 || s[i] == t[j])
		{
			i++; j++;
		}
		else
			j = next[j];
		}
		if (j >= lent) return i-j;
	}


}
int main()
{
	string s, t;
	cin >> s >> t;
	kmp(s, t);

	for (int i=0;i<ans.size();++i)
	cout << ans[i][0]<< ' '<<ans[i][1] << endl;

	return 0;
}