g2401_2500.s2442_count_number_of_distinct_integers_after_reverse_operations

Class Solution

java.lang.Object

g2401_2500.s2442_count_number_of_distinct_integers_after_reverse_operations.Solution

public class Solution
extends Object

2442 - Count Number of Distinct Integers After Reverse Operations.

Medium

You are given an array nums consisting of positive integers.

You have to take each integer in the array, reverse its digits , and add it to the end of the array. You should apply this operation to the original integers in nums.

Return the number of distinct integers in the final array.

Example 1:

Input: nums = [1,13,10,12,31]

Output: 6

Explanation: After including the reverse of each number, the resulting array is [1,13,10,12,31,1,31,1,21,13]. The reversed integers that were added to the end of the array are underlined. Note that for the integer 10, after reversing it, it becomes 01 which is just 1. The number of distinct integers in this array is 6 (The numbers 1, 10, 12, 13, 21, and 31).

Example 2:

Input: nums = [2,2,2]

Output: 1

Explanation: After including the reverse of each number, the resulting array is [2,2,2,2,2,2]. The number of distinct integers in this array is 1 (The number 2).

Constraints:

• 1 <= nums.length <= 105
• 1 <= nums[i] <= 106

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
int	countDistinctIntegers(int[] nums)

Methods inherited from class java.lang.Object

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

Constructor Detail

Solution

public Solution()

Method Detail

countDistinctIntegers

public int countDistinctIntegers(int[] nums)