改善字符串比较方法java的运行时间和样式？

Question

I am trying to solve this problem: Write a function to check if two strings are the same length. If either string contains any numbers, those numbers are added to the length. Ex: "ab2" & "aabb" //true "hhhsss" & "12" //false "hello" & "sarah" //true "2abc" & a1a1a" //true

This is my code, it works but its slow, repetitive, too wordy and less efficient than it should be. I'm a beginner and looking for tips on how to improve this. Thanks in advance!

public static boolean pattern(String a, String b) {
    char A[] = a.toCharArray();
    char B[] = b.toCharArray();

    Arrays.sort(A);
    Arrays.sort(B);

    int i = 0;
    int timesA = 0;
    int lengthA = 0;
    while (i < A.length && Character.isDigit(A[i])) {
        lengthA += A[i];
        timesA++;
        i++;
    }
    lengthA += A.length - timesA;

    int j = 0;
    int timesB = 0;
    int lengthB = 0;
    while (j < B.length && Character.isDigit(B[j])) {
        lengthB += B[j];
        timesB++;
        j++;
    }
    lengthB += B.length - timesB;

    return lengthA == lengthB;
}

Answer 1

I would do some changes in your overall strategy.

You do not neet to sort the two strings in the beginning.

Create four variables: a counter and a digit buffer for each string.

Loop over each char of the two strings and if it is:

a digit : concatenate the digit to the respective buffer

not a digit : add 1 to the respective counter. Also, evaluate the respective buffer as a number and add the result to the counter. Empty the buffer.