<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[codingyuhan的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/codingyuhan</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; codingyuhan]]></copyright><item><title><![CDATA[mysql 面试题总结]]></title><link>https://blog.csdn.net/codingyuhan/article/details/125697580</link><guid>https://blog.csdn.net/codingyuhan/article/details/125697580</guid><author>codingyuhan</author><pubDate>Sat, 09 Jul 2022 19:16:23 +0800</pubDate><description><![CDATA[mysql面试题]]></description><category></category></item><item><title><![CDATA[redis 面试题总结]]></title><link>https://blog.csdn.net/codingyuhan/article/details/125697421</link><guid>https://blog.csdn.net/codingyuhan/article/details/125697421</guid><author>codingyuhan</author><pubDate>Sat, 09 Jul 2022 19:06:34 +0800</pubDate><description><![CDATA[redis面试题]]></description><category></category></item><item><title><![CDATA[数组中的第k个最大元素（几种排序的解法）]]></title><link>https://blog.csdn.net/codingyuhan/article/details/124578449</link><guid>https://blog.csdn.net/codingyuhan/article/details/124578449</guid><author>codingyuhan</author><pubDate>Wed, 04 May 2022 21:59:52 +0800</pubDate><description><![CDATA[​
leetcode 题号215

快速排序算法

func findKthLargest(nums []int, k int) int {
    quickSort(nums, 0, len(nums)-1)
    return nums[len(nums)-k]
}

func quickSort(nums []int, left, right int) {
    if left &gt;= right { return }
    tmp, i, j := nums[left], left, r]]></description><category></category></item></channel></rss>