g2201_2300.s2288_apply_discount_to_prices.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
The newest version!
package g2201_2300.s2288_apply_discount_to_prices;
// #Medium #String #2022_06_17_Time_82_ms_(97.98%)_Space_68.3_MB_(85.92%)
public class Solution {
public String discountPrices(String sentence, int discount) {
String[] words = sentence.split(" ");
StringBuilder sb = new StringBuilder();
for (String word : words) {
sb.append(applyDiscount(word, discount));
sb.append(" ");
}
sb.deleteCharAt(sb.length() - 1);
return sb.toString();
}
private String applyDiscount(String s, int discount) {
if (s.charAt(0) == '$' && s.length() > 1) {
long price = 0;
for (int i = 1; i < s.length(); i++) {
if (!Character.isDigit(s.charAt(i))) {
// Error case. We could also use Long.parseLong() here.
return s;
}
price *= 10;
price += (long) (s.charAt(i) - '0') * (100 - discount);
}
String stringPrice = String.valueOf(price);
if (price < 10) {
return "$0.0" + stringPrice;
}
if (price < 100) {
return "$0." + stringPrice;
}
return "$"
+ stringPrice.substring(0, stringPrice.length() - 2)
+ "."
+ stringPrice.substring(stringPrice.length() - 2);
}
return s;
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy