<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a835421883的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a835421883</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a835421883]]></copyright><item><title><![CDATA[c++中string&char *&char[]之间如何转换（示例）]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141803</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141803</guid><author>a835421883</author><pubDate>Thu, 14 Mar 2019 08:51:00 +0800</pubDate><description><![CDATA[本篇文章给大家带来的内容是关于C++中string&amp;char *&amp;char[]之间如何转换（示例），有一定的参考价值，有需要的朋友可以参考一下，希望对你有所帮助。

一、string转char*。
　　主要有三种方法可以将str转换为char*类型，分别是：data(); c_str(); copy();
1.data()方法，如：




1
2...]]></description><category></category></item><item><title><![CDATA[Java多线程基础：进程和线程之由来]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141784</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141784</guid><author>a835421883</author><pubDate>Thu, 10 Mar 2016 15:27:00 +0800</pubDate><description><![CDATA[Java多线程基础：进程和线程之由来
　　在前面，已经介绍了Java的基础知识，现在我们来讨论一点稍微难一点的问题：Java并发编程。当然，Java并发编程涉及到很多方面的内容，不是一朝一夕就能够融会贯通使用的，需要在实践中不断积累。由于并发肯定涉及到多线程，因此在进入并发编程主题之前，我们先来了解一下进程和线程的由来，这对后面对并发编程的理解将会有很大的帮助。
　　下面是本文...]]></description><category></category></item><item><title><![CDATA[Win8博文]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141782</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141782</guid><author>a835421883</author><pubDate>Sat, 13 Oct 2012 23:24:00 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/hebeiDGL/

转载于:https://www.cnblogs.com/tomctx/archive/2012/10/13/2723143.html]]></description><category></category></item><item><title><![CDATA[贪心算法-活动安排]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141802</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141802</guid><author>a835421883</author><pubDate>Tue, 01 May 2012 15:57:00 +0800</pubDate><description><![CDATA[//《算法》P103 1 template &lt;typename Type&gt;
 2 void greedySelector(int n, Type s[], Type f[], bool A[])
 3 {
 4     A[1] = true;
 5     int j = 1;
 6     for(int i = 2; i &lt;= n; ++ i){
...]]></description><category></category></item><item><title><![CDATA[动态规划-0-1背包]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141800</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141800</guid><author>a835421883</author><pubDate>Tue, 01 May 2012 15:48:00 +0800</pubDate><description><![CDATA[1 #include &lt;iostream&gt;
 2 #include &lt;cstdlib&gt;
 3 #include&lt;cstring&gt;
 4 using namespace std;
 5 
 6 int max(int a, int b)
 7 {
 8     return (a &gt;= b)? a : b;
 9 }
10 ...]]></description><category></category></item><item><title><![CDATA[动态规划-矩阵连乘]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141780</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141780</guid><author>a835421883</author><pubDate>Tue, 01 May 2012 11:08:00 +0800</pubDate><description><![CDATA[《算法》P49


 1 #include &lt;stdio.h&gt;
 2 #include &lt;stdlib.h&gt;
 3 #include&lt;string.h&gt;
 4 //int m[102][102], s[102][102];
 5 void MatrixChain(int *p, int n, int m[][102], int s[][...]]></description><category></category></item><item><title><![CDATA[分治法-快速排序]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141778</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141778</guid><author>a835421883</author><pubDate>Mon, 30 Apr 2012 13:51:00 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdlib&gt;
#include&lt;cstring&gt;
using namespace std;

template&lt;typename Type&gt;
int partition(Type a[], int low, int high)
{
    //返回基准元素的...]]></description><category></category></item><item><title><![CDATA[分治法-归并排序]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141776</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141776</guid><author>a835421883</author><pubDate>Sun, 29 Apr 2012 15:53:00 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdlib&gt;
#include&lt;cstring&gt;
using namespace std;

#define LQ( a, b)    ((a) &lt;= (b))
#define EQ(a, b)    ((a) == (b))
#define LT(a, b)   ...]]></description><category></category></item><item><title><![CDATA[分治法-二分查找]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141797</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141797</guid><author>a835421883</author><pubDate>Sun, 29 Apr 2012 13:29:00 +0800</pubDate><description><![CDATA[对已排列好的非递减数组进行查找。
（1）非递归算法：


#include &lt;iostream&gt;
#include&lt;cstdlib&gt;
using namespace std;

template &lt;typename Type&gt;
int binarySearch(Type a[], const Type &amp;x, int n)...]]></description><category></category></item><item><title><![CDATA[动态规划-最长公共子序列]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141775</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141775</guid><author>a835421883</author><pubDate>Fri, 20 Apr 2012 11:41:00 +0800</pubDate><description><![CDATA[《算法设计与分析》P56




 1 #include&lt;iostream&gt;
 2 #include&lt;cstdlib&gt;
 3 using namespace std;
 4 
 5 void LCSLength(int m, int n, char *x, char *y, int c[][10], int b[][10]) //定义函数时，*...]]></description><category></category></item><item><title><![CDATA[分治法-求最大最小元]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141795</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141795</guid><author>a835421883</author><pubDate>Sat, 07 Apr 2012 13:16:00 +0800</pubDate><description><![CDATA[用分治法求n个元素集合S中的最大、最小元素（要求每次平分成2个子集）


void maxmin(int A[], int &amp;e_max, int &amp;e_min ,int low, int high) {     int mid, x1, y1, x2, y2;     if (high - low &lt;= 1) {　　　　　　　　　　　　　//&lt;=,可...]]></description><category></category></item><item><title><![CDATA[《数据结构Chapter10·内部排序》]]></title><link>https://blog.youkuaiyun.com/a835421883/article/details/101141793</link><guid>https://blog.youkuaiyun.com/a835421883/article/details/101141793</guid><author>a835421883</author><pubDate>Mon, 20 Feb 2012 09:40:00 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;#include&lt;string.h&gt;#include&lt;stdlib.h&gt;#define MAXSIZE 20typedef int Keytype;typedef struct{    Keytype key;//    char *otherinfo;}Redtype;typedef struct{    Red...]]></description><category></category></item></channel></rss>