2697. 字典序最小回文串

2697. 字典序最小回文串

• 难度: easy
• 原始链接: https://leetcode.cn/problems/lexicographically-smallest-palindrome
• 标签: 双指针

解法一: go 双指针

go

func makeSmallestPalindrome(s string) string {
    bytes := []byte(s)
    left := 0
    right := len(s) - 1
    for left < right {
        if bytes[left] <= bytes[right] {
            bytes[right] = bytes[left]
        } else {
            bytes[left] = bytes[right]
        }
        left++
        right--
    }
    return string(bytes)
}

解法二: java 一行代码

java

class Solution {
    public String makeSmallestPalindrome(String s) {
        return IntStream.range(0, s.length())
                .mapToObj(i -> String.valueOf((char) Math.min(s.charAt(i), s.charAt(s.length() - i - 1))))
                .collect(Collectors.joining());
    }
}