PHP 解法, 执行用时: 10ms, 内存消耗: 3108K, 提交时间: 2023-08-10 10:37:42

<?php

$input = explode(' ', fgets(STDIN));
$n = intval($input[0]);
$m = intval($input[1]);

$s = fgets(STDIN);
$k = fgets(STDIN);

$ans = '';
for ( $i = 0; $i < $n; $i++ ) {
    if ( ord($s[$i]) >= ord('a') && ord($s[$i]) <= ord('z') ) $ans .= $s[$i];
}
echo strpos($ans, trim($k)) === false ? "NO" : "YES";

Java 解法, 执行用时: 122ms, 内存消耗: 14600K, 提交时间: 2023-08-10 10:22:38

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        String str = sc.next();
        String key = sc.next();
        String ans = "";
        for (int i = 0; i < n; i++) {
            int a = str.charAt(i) - 'a';
            if ( a>=0 && a<26 ) ans += str.charAt(i);
        }
        System.out.println(ans.contains(key) ? "YES" : "NO");
    }
}

Go 解法, 执行用时: 4ms, 内存消耗: 1284K, 提交时间: 2023-08-10 10:19:37

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)
var n, m int
func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024*1024), 1024*1024)
	n, m = scanInt(sc), scanInt(sc)
	sc.Scan()
	s := sc.Text()
	sc.Scan()
	k := sc.Text()
	t := []rune{} 
	for _, v := range s {
		if v >= 'a' && v <= 'z' {
			t = append(t, v)
		}
	}
	if strings.Contains(string(t), k) {
		fmt.Print("YES")
	} else {
		fmt.Print("NO")
	}
}

func scanInt(scanner *bufio.Scanner) int {
	scanner.Scan()
	a, _ := strconv.Atoi(scanner.Text())
	return a
}