Class Solution
Easy
You are given a string number representing a positive integer and a character digit.
Return the resulting string after removing exactly one occurrence of digit from number such that the value of the resulting string in decimal form is maximized. The test cases are generated such that digit occurs at least once in number.
Example 1:
Input: number = “123”, digit = “3”
Output: “12”
Explanation: There is only one ‘3’ in “123”. After removing ‘3’, the result is “12”.
Example 2:
Input: number = “1231”, digit = “1”
Output: “231”
Explanation: We can remove the first ‘1’ to get “231” or remove the second ‘1’ to get “123”.
Since 231 > 123, we return “231”.
Example 3:
Input: number = “551”, digit = “5”
Output: “51”
Explanation: We can remove either the first or second ‘5’ from “551”.
Both result in the string “51”.
Constraints:
2 <= number.length <= 100numberconsists of digits from'1'to'9'.digitis a digit from'1'to'9'.digitoccurs at least once innumber.
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionjava.lang.StringremoveDigit(java.lang.String number, char digit) Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
removeDigit
public java.lang.String removeDigit(java.lang.String number, char digit)
-