Java入门：字符出现次数。。。

import java.util.HashSet;
import java.util.Scanner;

public class fist {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("请依次输入两个字符串：");
        String stg = scanner.nextLine();
        String sts = scanner.nextLine();
        int nums = stonesAndGem(stg,sts);
        System.out.println("前者的字符在后者出现的次数为：");
        System.out.println(nums);
        System.out.println("<><><><><><><><><><><><><><>");
        int[] rat = new int[]{4,5,6,2,3,1,8};
        System.out.println(teamS(rat));//求增长或递减列数，例456，423
    }

    public static int stonesAndGem(String stg,String sts) {
        int count = 0;
        HashSet<Character> hash = new HashSet<>();
        for(char a : stg.toCharArray()){
            hash.add(a);
        }
        for(char b : sts.toCharArray()){
            if(hash.contains(b)){
                count++;
            }
        }
        return count;
    }

    public static int teamS(int[] rating){
        int teams = 0;
        for(int a =0; a < rating.length; a++) {
            for (int b = a+1; b < rating.length; b++) {
                for (int c = b+1; c < rating.length; c++) {
                    if(rating[a]<rating[b] && rating[b]<rating[c]){
                        teams++;
                    }else if(rating[a]>rating[b] && rating[b]>rating[c]){
                        teams++;
                    }
                }
            }
        }
        return teams;
    }
}