<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Jiang_Yu的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Jiang_Yu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Jiang_Yu]]></copyright><item><title><![CDATA[leetcode 寻找两个正序数组的中位数 题解实现]]></title><link>https://blog.youkuaiyun.com/Jiang_Yu/article/details/106101916</link><guid>https://blog.youkuaiyun.com/Jiang_Yu/article/details/106101916</guid><author>Jiang_Yu</author><pubDate>Wed, 13 May 2020 16:58:46 +0800</pubDate><description><![CDATA[From:https://leetcode-cn.com/problems/median-of-two-sorted-arrays/



4. 寻找两个正序数组的中位数

给定两个大小为 m 和 n 的正序（从小到大）数组nums1和nums2。

请你找出这两个正序数组的中位数，并且要求算法的时间复杂度为O(log(m + n))。

你可以假设nums1和nums2不会同时为空。



示例 1:


nums1 = [1, 3]
nums2 = [2]

则中位数是 2.0

...]]></description><category></category></item><item><title><![CDATA[C++ 判定字符串是否为数值]]></title><link>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105929581</link><guid>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105929581</guid><author>Jiang_Yu</author><pubDate>Tue, 05 May 2020 11:12:33 +0800</pubDate><description><![CDATA[bool isIntNum(const string&amp;str, const bool&amp; bIsHex)
{
	if (str.empty()) return false;

	auto it = str.begin();
	if (str.at(0) == '-' &amp;&amp; str.size() &gt; 1)
	{
		++it;
	}
	for (; it != ...]]></description><category></category></item><item><title><![CDATA[C++ 字符串拆分]]></title><link>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105929533</link><guid>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105929533</guid><author>Jiang_Yu</author><pubDate>Tue, 05 May 2020 11:09:24 +0800</pubDate><description><![CDATA[vector&lt;string&gt; splitStr(const string &amp;str, char seoperator)
{
	int iSize = str.size();
	if (iSize == 0) return vector&lt;string&gt;(0);

	int iCount = count(str.begin(), str.end(), seopera...]]></description><category></category></item><item><title><![CDATA[C++ 获取系统时间]]></title><link>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105928129</link><guid>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105928129</guid><author>Jiang_Yu</author><pubDate>Tue, 05 May 2020 09:46:32 +0800</pubDate><description><![CDATA[//Y年M月D日H时M分S秒M毫秒
typedef enum DataType {
	YMD = 0,//年月日
	YMDHMS,//年月日时分秒
	YMDHMSM, //年月日时分秒毫秒
	DMY,//日月年
	MDY,//月日年
	HMS,//时分秒
	HMSM//时分秒毫秒
}DATATYPE;

string getSysTime(const DATATYPE&amp; iMode, c...]]></description><category></category></item><item><title><![CDATA[C++  目录中文件查找]]></title><link>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105928067</link><guid>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105928067</guid><author>Jiang_Yu</author><pubDate>Tue, 05 May 2020 09:43:21 +0800</pubDate><description><![CDATA[bool sort_finddata_tByTimeCreateUp(const _finddata_t&amp; f1, const _finddata_t&amp; f2)
{
	return f1.time_create &lt; f2.time_create;
}

bool sort_finddata_tByTimeCreateDown(const _finddata_t&amp; f...]]></description><category></category></item><item><title><![CDATA[C++ 文件输出]]></title><link>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105928009</link><guid>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105928009</guid><author>Jiang_Yu</author><pubDate>Tue, 05 May 2020 09:39:35 +0800</pubDate><description><![CDATA[/*
	--			strFilePath - 文件路径
	--			bIsBinary -是否为二进制文件读取方式
*/
bool outAllFile(const string&amp; strFilePath, const string&amp; strSrc, const unsigned int&amp; uMode, const bool&amp; bIsBinary) const
{...]]></description><category></category></item><item><title><![CDATA[C++ 获取文件内容]]></title><link>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105927938</link><guid>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105927938</guid><author>Jiang_Yu</author><pubDate>Tue, 05 May 2020 09:34:03 +0800</pubDate><description><![CDATA[/*	@ Input Param:
	--			strFilePath - 文件路径
	--			bIsBinary -是否为二进制文件读取方式
*/
string getAllFile(const string&amp; strFilePath, const bool&amp; bIsBinary)
{
	string strRet = "";

	ifstream inFile;
	if (...]]></description><category></category></item><item><title><![CDATA[windows C++ 递归创建文件夹]]></title><link>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105927860</link><guid>https://blog.youkuaiyun.com/Jiang_Yu/article/details/105927860</guid><author>Jiang_Yu</author><pubDate>Tue, 05 May 2020 09:29:45 +0800</pubDate><description><![CDATA[//eg: strPath = "D:\\file\\test\\1.txt" 递归检查并创建该路径中的文件夹


void createFolderForPath(const string&amp; strPath)
{
	string strFolder;
	int iPos = strPath.find_last_of('\\');
	if (iPos != -1)
	{
		strFold...]]></description><category></category></item></channel></rss>