Given a number N, the task is to minimize the number by changing at most K digits. Note that the number should not contain any leading zeros.
Examples:
Input: N = 91945, K = 3
Output: 10045Input: N = 1, K = 0
Output: 1
Approach:
- Replace the first digit with 1 if its not already 1 and update K accordingly.
- Now for the rest of the digits, replace the next K – 1 non-zero digits with a 0.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <iostream> using namespace std; // Function to return the minimized number string minNum(string num, int k) { // Total digits in the number int len = num.length(); // If the string is empty or there // are no operations to perform if (len == 0 || k == 0) return num; // "0" is a valid number if (len == 1) return "0"; // If the first digit is not already 1 then // update it to 1 and decrement k if (num[0] != '1') { num[0] = '1'; k--; } int i = 1; // While there are operations left // and the number can still be updated while (k > 0 && i < len) { // If the current digit is not already 0 // then update it to 0 and decrement k if (num[i] != '0') { num[i] = '0'; k--; } i++; } // Return the minimised number return num; } // Driver code int main() { string num = "91945"; int k = 3; cout << minNum(num, k); return 0; } |
chevron_right
filter_none
Java
// Java implementation of the approach class GFG { // Function to return the minimized number static String minNum(char num[], int k) { // Total digits in the number int len = num.length; // If the string is empty or there // are no operations to perform if (len == 0 || k == 0) { String num_str = new String(num); return num_str; } // "0" is a valid number if (len == 1) return "0"; // If the first digit is not already 1 then // update it to 1 and decrement k if (num[0] != '1') { num[0] = '1'; k--; } int i = 1; // While there are operations left // and the number can still be updated while (k > 0 && i < len) { // If the current digit is not already 0 // then update it to 0 and decrement k if (num[i] != '0') { num[i] = '0'; k--; } i++; } String num_str = new String(num); // Return the minimised number return num_str; } // Driver code public static void main(String args[]) { String num = "91945"; int k = 3; System.out.println(minNum(num.toCharArray(), k)); } } // This code is contributed by AnkitRai01 |
chevron_right
filter_none
Python3
# Python 3 implementation of the approach # Function to return the minimized number def minNum(num, k) : # Total digits in the number len_ = len(num) # If the string is empty or there # are no operations to perform if len_ == 0 or k == 0 : return num # "0" is a valid number if len_ == 1: return "0" # If the first digit is not already 1 then # update it to 1 and decrement k if num[0] != '1' : num = '1' + num[1:] k -= 1 i = 1 # While there are operations left # and the number can still be updated while k > 0 and i < len_ : # If the current digit is not already 0 # then update it to 0 and decrement k if num[i] != '0' : num = num[:i] + '0' + num[i + 1:] k -= 1 i += 1 # Return the minimised number return num # Driver code num = "91945"k = 3 print(minNum(num, k)) # This code is contributed by divyamohan123 |
chevron_right
filter_none
C#
// C# implementation of the approach using System; class GFG { // Function to return the minimized number static String minNum(char []num, int k) { // Total digits in the number int len = num.Length; // If the string is empty or there // are no operations to perform if (len == 0 || k == 0) { return String.Join("", num); } // "0" is a valid number if (len == 1) return "0"; // If the first digit is not already 1 then // update it to 1 and decrement k if (num[0] != '1') { num[0] = '1'; k--; } int i = 1; // While there are operations left // and the number can still be updated while (k > 0 && i < len) { // If the current digit is not already 0 // then update it to 0 and decrement k if (num[i] != '0') { num[i] = '0'; k--; } i++; } // Return the minimised number return String.Join("", num); } // Driver code public static void Main(String []args) { String num = "91945"; int k = 3; Console.WriteLine(minNum(num.ToCharArray(), k)); } } // This code is contributed by 29AjayKumar |
chevron_right
filter_none
Output:
10045
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Find the largest number that can be formed by changing at most K digits
- Minimize difference after changing all odd elements to even
- Minimize the sum of digits of A and B such that A + B = N
- Find smallest number with given number of digits and sum of digits under given constraints
- Count of integers in a range which have even number of odd digits and odd number of even digits
- Find the minimum number possible by changing at most one digit
- Removing a number from array without changing its arithmetic mean
- Check if a number is power of k using base changing method
- Check whether product of digits at even places is divisible by sum of digits at odd place of a number
- Count of numbers between range having only non-zero digits whose sum of digits is N and number is divisible by M
- Maximize the given number by replacing a segment of digits with the alternate digits given
- Find smallest number with given number of digits and sum of digits
- Find the Largest number with given number of digits and sum of digits
- Number formed by deleting digits such that sum of the digits becomes even and the number odd
- Number of steps to sort the array by changing order of three elements in each step
- Minimum number of digits to be removed so that no two consecutive digits are same
- Find the average of k digits from the beginning and l digits from the end of the given number
- Check if the sum of digits of number is divisible by all of its digits
- Smallest number with given sum of digits and sum of square of digits
- Minimize the cost to split a number
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
