pta 7-6 破译报文

问题：求最长重复字串

方法一：暴力

#include <iostream>
#include <unordered_map>
using namespace std;
const int N = 10010;
unordered_map<string, int> mp; //查询对应字串是否存在
string str;
int n, ans;

int main()
{
    cin >> str;
    int n = str.size();
    for (int i = 1; i < n; i ++ )
    {
        //unordered_map 插入过多会mle 每用一次清空一次 
        mp.clear();
        bool flag = false;
        for (int j = 0; j < n; j ++ )
        {
            if (i + j > n) break;
            //string.substr(idx, length)
            if (mp.count(str.substr(j, i)))
            {
                flag = true;
                ans = i;
                break;
            }
            else mp[str.substr(j, i)];
        }
        if (!flag) break;
    }
    printf("%d\n",ans);
}

方法二：字符串哈希＋二分

#include <iostream>
#include <cstring>
#include <unordered_map>
using namespace std;
//可以取ull自动取模
const int N = 10010, mod = 1e9, P = 100007;
unordered_map<int, int>mp;
char str[N];
int h[N], p[N], n, ans;

int query(int l, int r)
{
    //手动取模 查询下标从1到n
	return ((h[r] - h[l - 1] * p[r - l + 1] % mod) + mod) % mod;
}

bool judge(int x)
{
	mp.clear();
	for (int i = 0; i < n - x; i ++ )
	{
		int hash = query(i + 1, i + x + 1);
		if (mp[hash]) return 1;
		mp[hash] = 1;
	}
	return 0;
}

int main()
{
	scanf("%s", str);
	n = strlen(str);

	p[0] = 1;
	for (int i = 0; i < n; i ++ )
	{
		p[i + 1] = p[i] * P;
		h[i + 1] = h[i] * P + str[i];
	}

    //利用二分单调性
	//长度为n的字串一定是长度为n-1字串 二分查找出最大字串长度
	int l = 0, r = n - 1;
	while (l < r)
	{
		int mid = l + r >> 1;
		if (judge(mid)) l = mid + 1;
		else r = mid;
	}
	printf("%d\n", l);
}