java - 1000位的字符串，使用substring方法在没有数组的情况下找到最大的5位

Question

我知道我的代码可以变得更简单、更高效，但我正在努力让它以这种方式工作。

我想从字符串中获取由 5 位数字组成的最大数字。我想使用 subString 方法。作为输出，我只得到前 5 个数字，它不会遍历字符串的其余部分。

public class thousandDigits
{
   public static void main(String[] args)
   {

    String num = new String ("73167176531330624919225119674426574742355349194934" +
                             "96983520312774506326239578318016984801869478851843" +
                             "85861560789112949495459501737958331952853208805511" +
                             "12540698747158523863050715693290963295227443043557" +
                             "66896648950445244523161731856403098711121722383113" +
                             "62229893423380308135336276614282806444486645238749" +
                             "30358907296290491560440772390713810515859307960866" +
                             "70172427121883998797908792274921901699720888093776" +
                             "65727333001053367881220235421809751254540594752243" +
                             "52584907711670556013604839586446706324415722155397" +
                             "53697817977846174064955149290862569321978468622482" +
                             "83972241375657056057490261407972968652414535100474" +
                             "82166370484403199890008895243450658541227588666881" +
                             "16427171479924442928230863465674813919123162824586" +
                             "17866458359124566529476545682848912883142607690042" +
                             "24219022671055626321111109370544217506941658960408" +
                             "07198403850962455444362981230987879927244284909188" +
                             "84580156166097919133875499200524063689912560717606" +
                             "05886116467109405077541002256983155200055935729725" +
                             "71636269561882670428252483600823257530420752963450") ;


    int greatest = 0;
    int max = -1;
    int numChar = Integer.parseInt(num.substring(0, 5));

    for (int i = 0; i < num.length() - 5; i++) 
        {
             greatest = numChar;  

             if (max < greatest)
                {
                   max = greatest;
                }
        }
        System.out.print(max);
    }
}

输出是 7316，但它应该是出现的最大 5 位数字 99890。

Answer 1

那是因为您没有更新循环内的 numChar。一开始你只做一次。另外，计算出的substring需要在循环中从i到i+5。

int greatest = 0;
int max = -1;
//int numChar = Integer.parseInt(num.substring(0, 5)); <-- Not Here

for (int i = 0; i < num.length() - 5; i++) {
    int numChar = Integer.parseInt(num.substring(i, i + 5)); //  <-- but here
    greatest = numChar;

    if (max < greatest) {
        max = greatest;
    }
}