<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[HEY JUDE]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ak0960</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ak0960]]></copyright><item><title><![CDATA[x的平方根]]></title><link>https://blog.youkuaiyun.com/ak0960/article/details/53509066</link><guid>https://blog.youkuaiyun.com/ak0960/article/details/53509066</guid><author>ak0960</author><pubDate>Fri, 30 Dec 2022 16:48:09 +0800</pubDate><description><![CDATA[实现int
 sqrt(int x)函数，计算并返回x的平方根。
样例


sqrt(3) = 1
sqrt(4) = 2
sqrt(5) = 2
sqrt(10) = 3


class Solution {
public:
    /**
     * @param x: An integer
     * @return: The sqrt of x]]></description><category></category></item><item><title><![CDATA[分糖果问题]]></title><link>https://blog.youkuaiyun.com/ak0960/article/details/53509188</link><guid>https://blog.youkuaiyun.com/ak0960/article/details/53509188</guid><author>ak0960</author><pubDate>Fri, 30 Dec 2022 16:46:54 +0800</pubDate><description><![CDATA[有N个小孩站成一列。每个小孩有一个评级。
按照以下要求，给小孩分糖果：


每个小孩至少得到一颗糖果。

相邻小孩之间，评级越高的小孩可以得到更多的糖果。

需最少准备多少糖果？class Solution {
public:
    /**
     * @param ratings Children's ratings
     * @return the minimum]]></description><category></category></item><item><title><![CDATA[使用mybatis存储一条数据后返回自增主键的值]]></title><link>https://blog.youkuaiyun.com/ak0960/article/details/82585948</link><guid>https://blog.youkuaiyun.com/ak0960/article/details/82585948</guid><author>ak0960</author><pubDate>Mon, 10 Sep 2018 10:33:08 +0800</pubDate><description><![CDATA[对于要存储的数据，有一个bean，bean中包含了自增主键id：


public class realBean{
    private int id;
    private String name;

    public realBean() {
        super();
    }

    public realBean(String name) {
        this....]]></description><category></category></item><item><title><![CDATA[QT导出excel]]></title><link>https://blog.youkuaiyun.com/ak0960/article/details/79912267</link><guid>https://blog.youkuaiyun.com/ak0960/article/details/79912267</guid><author>ak0960</author><pubDate>Thu, 12 Apr 2018 13:18:58 +0800</pubDate><description><![CDATA[在Qt中使用QAxObject类访问Com组件对象，需要在pro文件中添加下面的内容:QT       +=axcontainer  bool exportexcel()
{
        QString filePath = &quot;test.xlsx&quot;;
        QAxObject * work_book;
        QAxObject excel(&quot;Excel.Applicatio...]]></description><category></category></item><item><title><![CDATA[C++大楼轮廓]]></title><link>https://blog.youkuaiyun.com/ak0960/article/details/53607978</link><guid>https://blog.youkuaiyun.com/ak0960/article/details/53607978</guid><author>ak0960</author><pubDate>Tue, 13 Dec 2016 11:45:17 +0800</pubDate><description><![CDATA[水平面上有 N 座大楼，每座大楼都是矩阵的形状，可以用三个数字表示(start,
 end, height)，分别代表其在x轴上的起点，终点和高度。大楼之间从远处看可能会重叠，求出 N 座大楼的外轮廓线。

外轮廓线的表示方法为若干三元组，每个三元组包含三个数字 
(start, end, height)，代表这段轮廓的起始位置，终止位置和高度。






例如：

给]]></description><category></category></item><item><title><![CDATA[Intersection of Two Arrays II 两数组的交]]></title><link>https://blog.youkuaiyun.com/ak0960/article/details/53582546</link><guid>https://blog.youkuaiyun.com/ak0960/article/details/53582546</guid><author>ak0960</author><pubDate>Mon, 12 Dec 2016 14:44:11 +0800</pubDate><description><![CDATA[Given two arrays, write a function to compute their intersection.

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2,
 2], return [2, 2].

Note:


Each element in the result should appear as ma]]></description><category></category></item><item><title><![CDATA[Intersection of Two Arrays 两数组的交]]></title><link>https://blog.youkuaiyun.com/ak0960/article/details/53581879</link><guid>https://blog.youkuaiyun.com/ak0960/article/details/53581879</guid><author>ak0960</author><pubDate>Mon, 12 Dec 2016 13:40:44 +0800</pubDate><description><![CDATA[Given two arrays, write a function to compute their intersection.

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2,
 2], return [2].

Note:


Each element in the result must be unique.The res]]></description><category></category></item><item><title><![CDATA[接雨水问题（C++)]]></title><link>https://blog.youkuaiyun.com/ak0960/article/details/53520915</link><guid>https://blog.youkuaiyun.com/ak0960/article/details/53520915</guid><author>ak0960</author><pubDate>Thu, 08 Dec 2016 16:59:17 +0800</pubDate><description><![CDATA[Given n non-negative
 integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For
 example, 
Given [0,1,0,2,1,0,1,3,2,1,2,]]></description><category></category></item></channel></rss>