CodeForces_58A

最新推荐文章于 2024-09-17 11:50:15 发布

在地球迷路的怪兽

最新推荐文章于 2024-09-17 11:50:15 发布

阅读量130

点赞数

文章标签： java 算法 acm竞赛

本文链接：https://blog.csdn.net/qq_53324833/article/details/119513251

版权

Java 字符串处理字符遍历条件判断子串查找

关键词由CSDN通过智能技术生成

在这里插入图片描述

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()) {
            String s = sc.next();
            char[] str = s.toCharArray();
            char[] a = new char[5];
            int index = 0;
            for (int i = 0; i < str.length; i++) {
                if(str[i] == 'h') {
                    a[0] = str[i];
                    index = i+1;
                    break;
                }
            }
            for (int i = index; i < str.length; i++) {
                if(str[i] == 'e') {
                    a[1] = str[i];
                    index = i+1;
                    break;
                }
            }
            for (int i = index; i < str.length; i++) {
                if(str[i] == 'l') {
                    a[2] = str[i];
                    index = i+1;
                    break;
                }
            }
            for (int i = index; i < str.length; i++) {
                if(str[i] == 'l') {
                    a[3] = str[i];
                    index = i+1;
                    break;
                }
            }
            for (int i = index; i < str.length; i++) {
                if(str[i] == 'o') {
                    a[4] = str[i];
                    break;
                }
            }
            int count = 0;
            char[] h = {'h','e','l','l','o'};
            
            for (int i = 0; i < a.length; i++) {
                if(a[i] == h[i]) count++;
            }
            if(count == 5) System.out.println("YES");
            else System.out.println("NO");
        }
    }
}