笔试强训day12

---

---

删除公共字符

import sys

s = input()
t = input()
for v in s:
    if v not in t:
        print(v,end='')

---

---

两个链表的公共结点

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) {
        ListNode* h1 = pHead1,*h2 = pHead2;
		bool flag1 = true,flag2 = true;
		while(h1&&h2)
		{
			if(h1 == h2)return h1;
			h1 = h1->next;
			h2 = h2->next;
			if(h1==nullptr && flag1)
			{
				h1 = pHead2;
				flag1 = false;
			}
			if(h2 == nullptr && flag2)
			{
				h2 = pHead1;
				flag2 = false;
			}
		}
		return nullptr;
    }
};

---

---

mari和shiny

#include <iostream>
#include <string>
#include <algorithm>
#define int long long 

using namespace std;
const int N = 3e5 + 10;
int s[N], h[N], y[N];
int n;
string str;

signed main()
{
    //解法必然就是动态规划
    //不过，你是如何想到这道题是需要使用dp的？----经验（瞎蒙/尝试）呗
    //s[i]表示是[0,i]这个区间内's'的数量
    //h[i]表示的是[0,i]这个区间内'sh'的数量
    //y[i]表示的是[o,i]这个区间内'shy'的数量


    //下面推导一下状态转移方程
    //s[i] = str[i] == 's' ? s[i-1] + 1 : s[i-1]
    //h[i] = str[i] == 'h' ? s[i-1] + h[i-1] : h[i-1]
    //y[i] = str[i] == 'y' ? h[i-1] + y[i-1]:y[i-1]
    cin >> n>>str;
    s[0] = str[0] == 's';
    for (int i = 1; i < n; ++i)
    {
        s[i] = str[i] == 's' ? s[i - 1] + 1 : s[i - 1];
        h[i] = str[i] == 'h' ? s[i - 1] + h[i - 1] : h[i - 1];
        y[i] = str[i] == 'y' ? h[i - 1] + y[i - 1] : y[i - 1];
    }

    cout << y[n - 1] << '\n';
    return 0;
}

---