Text Document Analysis Codeforces Round#375-B
来源:互联网 发布:php开源oa办公系统 编辑:程序博客网 时间:2024/05/17 01:05
Modern text editors usually show some information regarding the document being edited. For example, the number of words, the number of pages, or the number of characters.
In this problem you should implement the similar functionality.
You are given a string which only consists of:
- uppercase and lowercase English letters,
- underscore symbols (they are used as separators),
- parentheses (both opening and closing).
It is guaranteed that each opening parenthesis has a succeeding closing parenthesis. Similarly, each closing parentheses has a preceding opening parentheses matching it. For each pair of matching parentheses there are no other parenthesis between them. In other words, each parenthesis in the string belongs to a matching "opening-closing" pair, and such pairs can't be nested.
For example, the following string is valid: "_Hello_Vasya(and_Petya)__bye_(and_OK)".
Word is a maximal sequence of consecutive letters, i.e. such sequence that the first character to the left and the first character to the right of it is an underscore, a parenthesis, or it just does not exist. For example, the string above consists of seven words: "Hello", "Vasya", "and", "Petya", "bye", "and" and "OK". Write a program that finds:
- the length of the longest word outside the parentheses (print 0, if there is no word outside the parentheses),
- the number of words inside the parentheses (print 0, if there is no word inside the parentheses).
The first line of the input contains a single integer n (1 ≤ n ≤ 255) — the length of the given string. The second line contains the string consisting of only lowercase and uppercase English letters, parentheses and underscore symbols.
Print two space-separated integers:
- the length of the longest word outside the parentheses (print 0, if there is no word outside the parentheses),
- the number of words inside the parentheses (print 0, if there is no word inside the parentheses).
37_Hello_Vasya(and_Petya)__bye_(and_OK)
5 4
37_a_(_b___c)__de_f(g_)__h__i(j_k_l)m__
2 6
27(LoooonG)__shOrt__(LoooonG)
5 2
5(___)
0 0
In the first sample, the words "Hello", "Vasya" and "bye" are outside any of the parentheses, and the words "and", "Petya", "and" and "OK" are inside. Note, that the word "and" is given twice and you should count it twice in the answer.
such sequence that the first character to the left and the first character to the right of it is an underscore, a parenthesis, or it just does not exist.
单词可以左右没有括号和下划线,注意不要理解错题意!
import java.io.*;import java.util.*;public class Main {public static void main(String[] args) {Scanner sc=new Scanner(System.in);int n=sc.nextInt();String s=sc.next();int flag1=0;int flag2=0;int flag3=0;int max=-1;int cur=0;int cur2=0;int number=0;boolean start=false;for(int i=0;i<n;i++){if(flag2==0){if(isAlpha(s.charAt(i))){cur++;//System.out.println(cur);}if(cur>0&&s.charAt(i)=='_'){max=Math.max(max, cur);cur=0;}if(cur>0&&s.charAt(i)=='('){max=Math.max(max, cur);cur=0;}} if(flag2==1){ if(isAlpha(s.charAt(i))){ cur2++; } if(s.charAt(i)=='_'||s.charAt(i)==')'){ if(cur2>0){ number++; cur2=0; } if(s.charAt(i)==')'){ flag2=0; } } } if(s.charAt(i)=='('){flag2=1;}}if(cur>0){max=Math.max(max, cur);cur=0;}if(max==-1){System.out.print(0+" ");}elseSystem.out.print(max+" ");System.out.println(number);}static boolean isAlpha(char a){if((a>='A'&&a<='Z')||(a>='a'&&a<='z')){return true;}elsereturn false;}}
- Text Document Analysis Codeforces Round#375-B
- Codeforces Round #375 (Div. 2)B. Text Document Analysis
- Codeforces Round #375 (Div. 2)B. Text Document Analysis
- Codeforces Round #375 Text Document Analysis
- 【Codeforces Round 375 (Div 2) B】【水模拟】Text Document Analysis
- Codeforces Round #375 (Div. 2) B.Text Document Analysis(分类暴力)
- Codeforces Round #375 (Div. 2) B. Text Document Analysis(字符串处理,简单题目)
- [codeforces] B. Text Document Analysis 字符分析
- 【44.10%】【codeforces 723B】Text Document Analysis
- Codeforces 723 B. Text Document Analysis
- Codeforces 723B Text Document Analysis
- CodeForces 723B Text Document Analysis
- Codeforces 723B-Text Document Analysis
- B. Text Document Analysis
- Codeforces 723B Text Document Analysis (字符串处理)
- CodeForces 723B Text Document Analysis(字符串的分析)
- CodeForces 723B-Text Document Analysis(模拟)
- Codeforces #375(Div.2)B.Text Document Analysis【模拟】水题
- Android-Blockly 如何编辑toolbox侧边菜单栏
- bnu52297Coins(弱校联盟第一场)--找规律
- [LeetCode]--104. Maximum Depth of Binary Tree
- Leetcode-39. Combination Sum
- Matlab的作图入门(二维)
- Text Document Analysis Codeforces Round#375-B
- 二叉树基本概念及性质
- hdu5510(并查集+KMP)
- linux(centos 7)下编译 hello World
- 循环
- hadoop VMware伪分布式
- A Tour of Go---Exercise: Fibonacci closure
- 二叉树编程实践
- 顶级开源人工智能工具推荐