String Compression Task

Develop an algorithm that compresses a string by replacing consecutive duplicate characters with the character followed by the count of its repetitions, if that count exceeds 1.

Example:

Input:

"xxxxx"

Output:

"x5"

Explanation:

The character 'x' is repeated 5 times consecutively, thus it is represented as 'x5'. The string is only modified if a character appears more than once consecutively.

Constraints:

• The consecutive occurrence count for each character in the string does not exceed 9.
• 0 <= N <= 10⁶, where 'N' represents the length of the input string.

Note:

You do not need to handle the output directly; focus on implementing the function to perform the task as specified.