Codeforces Round #496 (Div. 3) B. Delete from the Left（逆向思维）

本文链接：https://blog.csdn.net/sugarbliss/article/details/80982721

本文介绍了一种通过删除字符串最左侧字符使两个字符串相等的算法。该算法采用逆向思维，从字符串末尾开始比较，计算最少操作次数。适用于字符串长度不超过2×10^5的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given two strings $s$ and $t$ . In a single move, you can choose any of two strings and delete the first (that is, the leftmost) character. After a move, the length of the string decreases by $1$ . You can't choose a string if it is empty.

For example:

by applying a move to the string "where", the result is the string "here",
by applying a move to the string "a", the result is an empty string "".

You are required to make two given strings equal using the fewest number of moves. It is possible that, in the end, both strings will be equal to the empty string, and so, are equal to each other. In this case, the answer is obviously the sum of the lengths of the initial strings.

Write a program that finds the minimum number of moves to make two given strings $s$ and $t$ equal.

Input

The first line of the input contains $s$ . In the second line of the input contains $t$ . Both strings consist only of lowercase Latin letters. The number of letters in each string is between 1 and $2 \cdot 10^{5}$ , inclusive.

Output

Output the fewest number of moves required. It is possible that, in the end, both strings will be equal to the empty string, and so, are equal to each other. In this case, the answer is obviously the sum of the lengths of the given strings.

Examples
inputCopy
test
west
outputCopy
2
inputCopy
codeforces
yes
outputCopy
9
inputCopy
test
yes
outputCopy
7
inputCopy
b
ab
outputCopy
1

Note

In the first example, you should apply the move once to the first string and apply the move once to the second string. As a result, both strings will be equal to "est".

In the second example, the move should be applied to the string "codeforces" $8$ times. As a result, the string becomes "codeforces" $\to$ "es". The move should be applied to the string "yes" once. The result is the same string "yes" $\to$ "es".

In the third example, you can make the strings equal only by completely deleting them. That is, in the end, both strings will be empty.

In the fourth example, the first character of the second string should be deleted.

题意：给你两个字符串，让你删除最左端的字母，最终使得两个字符串相等（两个空字符串也是相等的）

思路：逆向思维

ACDAIMA:

#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s, t;
    while(cin >> s >> t)
    {
        int len1 = s.length();
        int len2 = t.length();
        int cnt = 0;
        for(int i = len1-1, j = len2-1; i >= 0,j >= 0; i--, j--)
        {
            if(s[i] == t[j])  cnt += 2;
            else break;
        }
        cout << len1+len2-cnt << endl;
    }
}