Algorithm/Programmers

[Programmers] Lv.0 / 접미사인지 확인하기 / Java

unknownomad 2023. 11. 28. 22:07

문제

 

풀이

class Solution {
    public int solution(String my_string, String is_suffix) {
        int answer = 0;
        for(int i = 0; i < my_string.length(); i++) {
            if(my_string.substring(i).equals(is_suffix)) {
                answer = 1;
            }
        }
        return answer;
    }
}
class Solution {
    public int solution(String my_string, String is_suffix) {
        if(my_string.endsWith(is_suffix)) {
            return 1;
        } else {
            return 0;
        }
    }
}

 

출처

https://school.programmers.co.kr/learn/courses/30/lessons/181908