关键字过滤：输入字符串s1和s2，判断s1中是否顺序包含s2

import java.util.Scanner;
 
public class solution {
 
        public String findit(String str){
        Scanner scanner = new Scanner(System.in);
        String str1 = scanner.next();
        String str2 = scanner.next();
        char[] char1 = str1.toCharArray();
        char[] char2 = str2.toCharArray();
        int p1 = 0;
        int p2 = 0;
        while(p1<str1.length() && p2<str2.length()){
            while(p1<str1.length() && p2<str2.length() && char1[p1]!=char2[p2]){
                p1++;
            }
            p1++;
            p2++;
        }
        if(p2 >= char2.length){
            return new String("不可描述");
        }else{
            return str1;
        }        
    }
}

public String includeStr(String s1, String s2){
        if(s1.length() < s2.length()) return s2;
        String s = "";
        int index = 0;
        for(int i = 0; i < s2.length(); i++){
            int j = index;
            for(; j < s1.length();){
                if(s2.charAt(i) == s1.charAt(j)){
                    s += s2.charAt(i);
                    index = j;
                    break;
                }else{
                    j++;
                }
            }
        }
        if(s.equals(s2)) return "不可描述";
        else return s2;
    }

str1=input()#第一次输入 str2=input()#第二次输入 list_str=[] for i in range(len(str1)):  for j in range(len(str2)):  if str1[i]==str2[j]:
            list_str.append(j)
new_list=[] print(list_str) for item in list_str:  if not item in new_list:
        new_list.append(item)
new_list.sort() print(new_list)
new_str="" for i in range(len(new_list)):
    new_str=new_str+str2[new_list[i]] if(new_str==str1): print("不可描述") else: print(str1)