zoukankan      html  css  js  c++  java
  • 编程复习1:寻找字符串中最大出现次数的所有字母

    题目输入输出

    "this is a sentence" => [t, h, i, s, i, s, a, s, e, n, t, e, n, c, e]
    "thiis iss a senntencee" => [i, s, n, e]
    "thiisss iss a senntttenceee" => [s, t, e]
    "thiisss iss a sennnntttenceee" => [n]

    solution:

    using system;
    class program
    {
    static void Main(string[] args)
    {
    string input='xxxx';
    string[] output=test(input);
    Console.WriteLine(output);

    }

    public string[] findMax (string s){
    string[] all=s.divide();
    int max=1;
    int current=1;
    bool active=false;
    for (int i=1;i++i<len){
    if all[i]=all[i-1] && active
    current+=1;
    else if all[i]=all[i-1]
    active=!active;
    current+=1;
    else if active
    active=!active
    if current<max
    max=current
    current=1

    }

    current=1;
    active=false;
    string[] output=new string[];
    for (int i=1;i++;i<len ){
    if all[i]=all[i-1] && active
    current+=1;
    else if all[i]=all[i-1]
    active=!active;
    current+=1;
    else if active
    active=!active
    if current==max
    output.add(all[i-1])
    current=1

    }

    }
    }

  • 相关阅读:
    POJ 3672 水题......
    POJ 3279 枚举?
    STL
    241. Different Ways to Add Parentheses
    282. Expression Add Operators
    169. Majority Element
    Weekly Contest 121
    927. Three Equal Parts
    910. Smallest Range II
    921. Minimum Add to Make Parentheses Valid
  • 原文地址:https://www.cnblogs.com/hytvszz/p/8377170.html
Copyright © 2011-2022 走看看