백준 알고리즘 - 1543번 문서검색

 

import java.util.Scanner;

public class Main {
   public static void main(String[] args) {
      String str1;
      String str2;
      int result = 0;

      Scanner sc= new Scanner(System.in);
      str1 = sc.nextLine();//베이스 스트링
      if(str1.length()>2500) return;
      str1 = str1.toLowerCase();

      str2 = sc.nextLine();//찾을 스트링;
      if(str2.length()>50) return;
      str2 = str2.toLowerCase();

      for(int i = 0 ; i < str1.length() - str2.length() + 1 ;){
         if(str1.substring(i, i+str2.length()).equals(str2)){
               result++;
               i = i + str2.length();
          } else {
            i++;
          }
      }
      System.out.println(result);
      sc.close();
   }
}