题解 | #字符串字符匹配#

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

int main() {
    string s, t;
    cin >> s >> t;
    
    // 将长字符串的字符存入哈希表
    vector<bool> mp(26);
    for(char c : t) {
        mp[c - 'a'] = true;
    }
    
    // 检查短字符串的每个字符是否在哈希表中
    bool found = true;
    for(char c : s) {
        if(!mp[c - 'a']) {
            found = false;
            break;
        }
    }
    
    cout << (found ? "true" : "false") << endl;
    return 0;
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String t = sc.nextLine();
        
        // 将长字符串的字符存入哈希表
        boolean[] mp = new boolean[26];
        for(char c : t.toCharArray()) {
            mp[c - 'a'] = true;
        }
        
        // 检查短字符串的每个字符是否在哈希表中
        boolean found = true;
        for(char c : s.toCharArray()) {
            if(!mp[c - 'a']) {
                found = false;
                break;
            }
        }
        
        System.out.println(found ? "true" : "false");
    }
}

s = input()
t = input()

# 将长字符串转换为字符集合
char_set = set(t)

# 检查短字符串的每个字符是否在集合中
result = all(c in char_set for c in s)
print("true" if result else "false")