LeetCode : Partition Label

https://leetcode.com/problems/partition-labels/submissions/ 

 
class Solution {
    public List<Integer> partitionLabels(String s) {
        //last Index 넣어라
        HashMap<String, Integer> hm = new HashMap<>();
        
        String[] splitMsg = s.split("");
        for(int i=0; i<splitMsg.length; i++){
            if(hm.containsKey(splitMsg[i])){
                hm.put(splitMsg[i], i+1);    
            }else{
               hm.put(splitMsg[i], i+1);    
            }
        }//end of for loop
        
        int lastIndex = 1;
        int lastValue = 0;
        List<Integer> answer = new LinkedList<>();
        
        //이미 확인된 알파벳은 더이상 보지 않습니다. 
        boolean[] visit = new boolean[123];
        for(int i=0; i<splitMsg.length; i++){
            
            if(hm.get(splitMsg[i])>lastIndex){
                // System.out.println("알파벳 : "+splitMsg[i]+" 몇번째 저장"+hm.get(splitMsg[i]) );
                //값을 빼서 저장
                lastIndex = hm.get(splitMsg[i]);
               
            }
            
            if(i+1 == lastIndex){
                // System.out.println("lastIndex : " + lastIndex);
                answer.add(lastIndex-lastValue);
                lastValue = lastIndex;
            }
           
        
        }
        return answer;
    }   
}