Golang每日一练(leetDay0120) 反转字符串中的元音字母、前K个高频元素

package main
import (
  "fmt"
  "strings"
)
func reverseVowels(s string) string {
  vowels := "aeiouAEIOU"
  // 将字符串转换为 byte 数组，方便交换字母
  str := []byte(s)
  left, right := 0, len(str)-1
  for left < right {
    // 左指针找到第一个元音字母
    for left < right && !strings.ContainsAny(vowels, string(str[left])) {
      left++
    }
    // 右指针找到第一个元音字母
    for left < right && !strings.ContainsAny(vowels, string(str[right])) {
      right--
    }
    // 交换左指针和右指针指向的字母
    str[left], str[right] = str[right], str[left]
    left++
    right--
  }
  return string(str)
}
func main() {
  fmt.Println(reverseVowels("hello"))
  fmt.Println(reverseVowels("leetcode"))
}

package main
import (
  "fmt"
  "strings"
)
func reverseVowels(s string) string {
  vowels := "aeiouAEIOU"
  str := []byte(s)
  reverse(str, 0, len(s)-1, vowels)
  return string(str)
}
func reverse(str []byte, left, right int, vowels string) {
  if left >= right {
    return
  }
  for left < right && !strings.ContainsAny(vowels, string(str[left])) {
    left++
  }
  for left < right && !strings.ContainsAny(vowels, string(str[right])) {
    right--
  }
  str[left], str[right] = str[right], str[left]
  reverse(str, left+1, right-1, vowels)
}
func main() {
  fmt.Println(reverseVowels("hello"))
  fmt.Println(reverseVowels("leetcode"))
}

package main
import (
  "fmt"
  "strings"
)
func reverseVowels(s string) string {
    vowels := "aeiouAEIOU"
    stack := []byte{}
    for _, char := range s {
        if strings.ContainsAny(vowels, string(char)) {
            stack = append(stack, byte(char))
        }
    }
    result := []byte(s)
    for i, char := range s {
        if strings.ContainsAny(vowels, string(char)) {
            result[i] = stack[len(stack)-1]
            stack = stack[:len(stack)-1]
        }
    }
    return string(result)
}
func main() {
  fmt.Println(reverseVowels("hello"))
  fmt.Println(reverseVowels("leetcode"))
}

package main
import "fmt"
func topKFrequent(nums []int, k int) []int {
  count := make(map[int]int)
  for _, num := range nums {
    count[num]++
  }
  buckets := make([][]int, len(nums)+1)
  for num, freq := range count {
    buckets[freq] = append(buckets[freq], num)
  }
  result := make([]int, 0)
  for i := len(nums); i >= 0 && len(result) < k; i-- {
    result = append(result, buckets[i]...)
  }
  return result[:k]
}
func main() {
  fmt.Println(topKFrequent([]int{1, 1, 1, 2, 2, 3}, 2))
  fmt.Println(topKFrequent([]int{1}, 1))
}