Add Java Solution for Chewbacca's Digit Inversion Problem

[Prathamesh-1011]

Description:
This issue is for adding a Java solution to solve the problem where Chewbacca wants to minimize a number by inverting some of its digits. Inverting a digit involves replacing it with 9 - t (where t is the original digit), ensuring that the resulting number is the smallest possible positive number and does not contain leading zeros.

Problem Description:
Input: A single integer x (1 ≤ x ≤ 10^18).
Output: The smallest possible number after inverting some digits, without leading zeros.

Hello @DHEERAJHARODE , I am a Hactoberfest - 2024 contributer, I want to contribute the solution of the problem statement to this repository. Kindly assign this issue to me. Thank you! :)