Package g2801_2900.s2843_count_symmetric_integers

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2843 - Count Symmetric Integers.

    Easy

    You are given two positive integers low and high.

    An integer x consisting of 2 * n digits is symmetric if the sum of the first n digits of x is equal to the sum of the last n digits of x. Numbers with an odd number of digits are never symmetric.

    Return the number of symmetric integers in the range [low, high].

    Example 1:

    Input: low = 1, high = 100

    Output: 9

    Explanation: There are 9 symmetric integers between 1 and 100: 11, 22, 33, 44, 55, 66, 77, 88, and 99.

    Example 2:

    Input: low = 1200, high = 1230

    Output: 4

    Explanation: There are 4 symmetric integers between 1200 and 1230: 1203, 1212, 1221, and 1230.

    Constraints:

    • <code>1 <= low <= high <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer countSymmetricIntegers(Integer low, Integer high)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait