14. Football

14. Football

  Petya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If there are at least 7 players of some team standing one after another, then the situation is considered dangerous. For example, the situation 00100110111111101 is dangerous and 11110111011101 is not. You are given the current situation. Determine whether it is dangerous or not.

Input

  The first input line contains a non-empty string consisting of characters "0" and "1", which represents players. The length of the string does not exceed 100 characters. There's at least one player from each team present on the field.

Output

  Print "YES" if the situation is dangerous. Otherwise, print "NO".

Examples
Input
  001001
Output
  NO
Input
  1000000001
Output
  YES

说明:不要看题目很长,其实这是一道水题,只需要判断字符串是否出现"0000000"或者"1111111",如果出现输出"YES",没有出现输出"NO"。两种方法:

方法一:

import java.util.Scanner;

public class Test14 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str = sc.nextLine();
        if(str.contains("0000000") || str.contains("1111111")){
            System.out.println("YES");
        }else{
            System.out.println("NO");
        }
        sc.close();
    }
}

方法二:

import java.util.Scanner;

public class Test14 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str = sc.nextLine();
        
        char[] chArr = str.toCharArray();
        int max = 0;
        int num = 0;

        for (int i = 0; i < chArr.length - 1; i++) {
            if (chArr[i] == chArr[i + 1]) {
                num++;
                if (num > max) {
                    max = num;
                }
                continue;
            } else {
                num = 0;
            }
        }

        if (max >= 7) {
            System.out.println("YES");
        } else {
            System.out.println("NO");
        }
        sc.close();
    }
}

 

转载于:https://www.cnblogs.com/tangxlblog/p/9973651.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值