[Programmers]-스킬트리

class Solution {
    public int solution(String skill, String[] skill_trees) {
        int answer = 0;
        int skill_Index = -1;
        
        for(int i=0;i<skill_trees.length;i++){//skill_trees
            
            int squenceAnswer = 0;
            String skill_trees_Squence = skill_trees[i];//스킬트리 순서
            
            for(int j=0;j<skill.length();j++){//skill
                
                int pre_skill_Index = skill_Index;
                skill_Index = 100;
                
                char skill_Squence = skill.charAt(j);//스킬 순서
                
                for(int k=0;k<skill_trees_Squence.length();k++){//skill_trees_Squence
                    
                    if(skill_Squence == skill_trees_Squence.charAt(k)){//같은 char형 이면
                        skill_Index = k;//인덱스 저장
                        break;
                    }
                }
                if(j != 0){
                    if(pre_skill_Index <= skill_Index) {
                    System.out.println("순서 비교가 맞아요"+pre_skill_Index+":"+skill_Index);
                    squenceAnswer++;
                }
                else System.out.println("순서 비교가 틀려요"+pre_skill_Index+":"+skill_Index);
                }
                
            }
            if(skill.length()-1 == squenceAnswer) answer++;
            System.out.println();
        }
        return answer;
    }
}