3106. 满足距离约束且字典序最小的字符串

满足距离约束且字典序最小的字符串

• 难度: medium
• 原始链接: https://leetcode.cn/problems/lexicographically-smallest-string-after-operations-with-constraint
• 标签: 贪心

解法一: 贪心

go

func getSmallestString(s string, k int) string {
  bytes := []byte(s)
  n := len(bytes)
  for i := 0; i < n; i++ {
    distance := int(min(bytes[i]-'a', 'z'-bytes[i]+1))
    if distance > k {
      bytes[i] -= byte(k)
      break
    }
    bytes[i] = 'a'
    k -= distance
  }
  return string(bytes)
}

java

class Solution {
    public String getSmallestString(String s, int k) {
        char[] chars = s.toCharArray();
        int n = chars.length;
        for (int i = 0; i < n; i++) {
            int distance = Math.min(chars[i] - 'a', 'z' - chars[i] + 1);
            if (distance > k) {
                chars[i] -= k;
                break;
            }
            chars[i] = 'a';
            k -= distance;
        }
        return String.valueOf(chars);
    }
}