<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u012889793的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u012889793</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u012889793]]></copyright><item><title><![CDATA[Egret eui.Scroller扩展]]></title><link>https://blog.youkuaiyun.com/u012889793/article/details/99944993</link><guid>https://blog.youkuaiyun.com/u012889793/article/details/99944993</guid><author>u012889793</author><pubDate>Wed, 21 Aug 2019 11:05:41 +0800</pubDate><description><![CDATA[支持任意位置索引的增加和删除




支持移动到顶部，底部以及任意索引位置




支持官方eui.Scroller item填不满可视视图不能滑动的问题




新增支持下拉刷新




只会显示可视区域item以及缓冲item，默认四个

效果图：



下载demo地址：https://github.com/a834286983/project/blob/master/SuperScr...]]></description><category></category></item><item><title><![CDATA[windows下zlib库的编译与使用（转）]]></title><link>https://blog.youkuaiyun.com/u012889793/article/details/93619578</link><guid>https://blog.youkuaiyun.com/u012889793/article/details/93619578</guid><author>u012889793</author><pubDate>Tue, 25 Jun 2019 14:57:20 +0800</pubDate><description><![CDATA[一、zlib库的编译
首先要下载这个库，这个谷歌和百度也都可以找得到的。我下载的是zlib-1.2.5，下载完解压出来即可。下边就开始编译吧。（包括动态库和静态库两种）


首先开启VS2010的Command Prompt (32bit)，也就是命令提示窗口。


进入到zlib-1.2.5/contrib/masmx86目录，执行bld_ml32.bat。（同理，64位的电脑进入masmx64...]]></description><category></category></item><item><title><![CDATA[Unity3d UGUI Text 增加下划线]]></title><link>https://blog.youkuaiyun.com/u012889793/article/details/83302047</link><guid>https://blog.youkuaiyun.com/u012889793/article/details/83302047</guid><author>u012889793</author><pubDate>Tue, 23 Oct 2018 09:26:11 +0800</pubDate><description><![CDATA[using System.Collections;
using System.Collections.Generic;
using UnityEngine;
using UnityEngine.EventSystems;
using UnityEngine.UI;

/*
    直接附加在存在Text脚本的GameObject对象即可
    仅仅支持单行且文本上下对齐方向必须居中
*/
pub...]]></description><category></category></item><item><title><![CDATA[顺时针打印矩阵]]></title><link>https://blog.youkuaiyun.com/u012889793/article/details/82878057</link><guid>https://blog.youkuaiyun.com/u012889793/article/details/82878057</guid><author>u012889793</author><pubDate>Fri, 28 Sep 2018 10:58:10 +0800</pubDate><description><![CDATA[vector&amp;lt;int&amp;gt; printMatrix(vector&amp;lt;vector&amp;lt;int&amp;gt; &amp;gt; matrix) {
	vector&amp;lt;int&amp;gt;* ret = new vector&amp;lt;int&amp;gt;();
	int rotate = 0;
	int x = 0, y = 0, w = matrix[0].size(), h = matrix.size();...]]></description><category></category></item><item><title><![CDATA[链表合并]]></title><link>https://blog.youkuaiyun.com/u012889793/article/details/82878031</link><guid>https://blog.youkuaiyun.com/u012889793/article/details/82878031</guid><author>u012889793</author><pubDate>Fri, 28 Sep 2018 10:56:49 +0800</pubDate><description><![CDATA[pHead1,pHead2都是单调递增链表,将二者合并成一个单调递增链表
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
	if (!pHead1 &amp;amp;&amp;amp; !pHead2)
		return nullptr;

	ListNode* merge = nullptr;

	while (pHead1 || pHead2)
	{...]]></description><category></category></item><item><title><![CDATA[单链表反转]]></title><link>https://blog.youkuaiyun.com/u012889793/article/details/82877971</link><guid>https://blog.youkuaiyun.com/u012889793/article/details/82877971</guid><author>u012889793</author><pubDate>Fri, 28 Sep 2018 10:54:11 +0800</pubDate><description><![CDATA[/链表节点结构体/
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
		val(x), next(NULL) {	
	}
};

/实现代码/
ListNode* ReverseList(ListNode*&amp;amp; pHead) {

	if (pHead == nullptr)
		return nu...]]></description><category></category></item><item><title><![CDATA[将一个int型十进制数字转成二进制数字字符串]]></title><link>https://blog.youkuaiyun.com/u012889793/article/details/82877748</link><guid>https://blog.youkuaiyun.com/u012889793/article/details/82877748</guid><author>u012889793</author><pubDate>Fri, 28 Sep 2018 10:43:43 +0800</pubDate><description><![CDATA[char* numberToBinaryString(int n)
{
	bool isLowZero = n &amp;amp;lt; 0;
	n = abs(n);
	char* str = new char[33];
	memset(str, 0, 33);
	unsigned short idx = 0;
	while (n != 0)
	{
		str[idx] = 0x30 + n % 2;
		id...]]></description><category></category></item><item><title><![CDATA[c++实现由数字和大小写字母组成的的一个不重复的字符串,长度5~10,首位不能是数字]]></title><link>https://blog.youkuaiyun.com/u012889793/article/details/81974978</link><guid>https://blog.youkuaiyun.com/u012889793/article/details/81974978</guid><author>u012889793</author><pubDate>Thu, 23 Aug 2018 09:46:55 +0800</pubDate><description><![CDATA[遇到过的一个面试,闲暇的时候实现了一下,有不对的地方请多多指教~

#include &amp;amp;amp;lt;string.h&amp;amp;amp;gt;

char* chSet;
__int64 cout = 0;

void recursion(int idx, int len, char* name)
{
    if (idx &amp;amp;amp;gt;= len)
    {
        return;
    }

    for ...]]></description><category></category></item></channel></rss>