Skip to content

小算法写复杂了额 #2

Description

@walkthehorizon

` private void calculateChangeNum(int change) {
if (change == 0) {
nums[0] = String.valueOf(count);
nums[1] = "";
nums[2] = "";
return;
}
toBigger = change > 0;
String oldNum = String.valueOf(count);
String newNum = String.valueOf(count + change);

    for (int i = 0; i < oldNum.length(); i++) {
        char oldC1 = oldNum.charAt(i);
        char newC1 = newNum.charAt(i);
        if (oldC1 != newC1) {
            nums[0] = i == 0 ? "" : newNum.substring(0, i);
            nums[1] = oldNum.substring(i);
            nums[2] = newNum.substring(i);
            break;
        }
    }
}`

嗯,其实这样就可以了,没必要单独判断总个数变化的情况,总个数变化时第一个字符必定不同

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions