JAVA_LeetCode 1967_Number of Strings That Appear as Substrings in Word 풀이 class Solution { public int numOfStrings(String[] patterns, String word) { int cnt = 0; for(int i = 0; i < patterns.length; i++){ if(word.contains(patterns[i])) cnt++; } return cnt; } } * 출처 https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word...
JAVA_LeetCode 1967_Number of Strings That Appear as Substrings in Word에 대한 요약내용입니다.
자세한 내용은 아래에 원문링크를 확인해주시기 바랍니다.
