• 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();
        }
    }
  • 相关阅读:
    C#中递归算法的总结
    C# 创建错误日志
    获取指定路径下所有PDF文件的总页数
    C# 将文件转为字符串和将字符串转为文件的方法
    如何获得应用程序的物理路径
    C#中获得文件夹下所有文件的两种方法
    C#中加密与解密
    MacOS系统使用Homebrew官方地址报错
    privoxy代理服务器配置
    Nginx 反向代理 502 permission denied 解决
  • 原文地址:https://www.cnblogs.com/tangxlblog/p/9973651.html
Copyright © 2020-2023  润新知