<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[draper__QYT的博客]]></title><description><![CDATA[一个小白程序猿的成长之路]]></description><link>https://blog.youkuaiyun.com/draper__QYT</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; draper__QYT]]></copyright><item><title><![CDATA[吴恩达机器学习（2）——线性回归与简单梯度下降]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/86584671</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/86584671</guid><author>draper__QYT</author><pubDate>Tue, 22 Jan 2019 14:07:45 +0800</pubDate><description><![CDATA[(x,y) one training example
(x(i),y(i)x^{(i)},y^{(i)}x(i),y(i))

]]></description><category></category></item><item><title><![CDATA[红酒、白酒数据集分析——案例(1)]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/86519129</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/86519129</guid><author>draper__QYT</author><pubDate>Thu, 17 Jan 2019 10:17:56 +0800</pubDate><description><![CDATA[

]]></description><category></category></item><item><title><![CDATA[POJ 2251 Dungeon Master（BFS）]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/81206206</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/81206206</guid><author>draper__QYT</author><pubDate>Wed, 25 Jul 2018 17:02:58 +0800</pubDate><description><![CDATA[POJ 2251 Dungeon Master 
三维迷宫的bfs，设置三维迷宫数组、移动方向数组、访问标记数组，然后bfs即可

#include&amp;lt;iostream&amp;gt;
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;queue&amp;gt;
#include&amp;lt;cstring&amp;gt;
using namespace std;

int vis[35][35][35...]]></description><category></category></item><item><title><![CDATA[UVA 11624 Fire（双向BFS）]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/81190599</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/81190599</guid><author>draper__QYT</author><pubDate>Tue, 24 Jul 2018 19:20:00 +0800</pubDate><description><![CDATA[UVA 11624 Fire 
题目链接： 
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;amp;Itemid=8&amp;amp;page=show_problem&amp;amp;problem=2671 
要求人在有限的时间内逃生，与求最短路径相似，用广搜 
开设两个二维数组，分别记录人、火到达某点的时间，然后进行两次BFS即可，...]]></description><category></category></item><item><title><![CDATA[HDU 1016 Prime Ring Problem（DFS）]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/81177169</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/81177169</guid><author>draper__QYT</author><pubDate>Tue, 24 Jul 2018 00:11:30 +0800</pubDate><description><![CDATA[HDU 1016 Prime Ring Problem 
dfs进行遍历即可

#include&amp;amp;lt;cstdio&amp;amp;gt;
#include&amp;amp;lt;iostream&amp;amp;gt;
#include&amp;amp;lt;cstring&amp;amp;gt; 
using namespace std;
//n最大为20，打表到40即可 
int prime[40]={0,1,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0...]]></description><category></category></item><item><title><![CDATA[HDU 1241 Oil Deposits（DFS）]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/81174586</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/81174586</guid><author>draper__QYT</author><pubDate>Mon, 23 Jul 2018 20:55:17 +0800</pubDate><description><![CDATA[HDU 1241 Oil Deposits 
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1241 
典型的dfs判断连通块数目的题目

#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;iostream&amp;gt;
using namespace std;

char land[100][100];
int num;
int di...]]></description><category></category></item><item><title><![CDATA[POJ 1321 棋盘问题（深搜）]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/81173925</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/81173925</guid><author>draper__QYT</author><pubDate>Mon, 23 Jul 2018 20:15:42 +0800</pubDate><description><![CDATA[POJ 1321 棋盘问题 
题目链接：http://poj.org/problem?id=1321 
设置一个数组，用来标记当前列是否有棋子放置 
因为按行进行判断，所以同行不可能有其他棋子

#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;iostream&amp;gt;
using namespace std;

int vis[10];            //记录本列是否...]]></description><category></category></item><item><title><![CDATA[SQL基础知识]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/80617563</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/80617563</guid><author>draper__QYT</author><pubDate>Fri, 08 Jun 2018 07:28:01 +0800</pubDate><description><![CDATA[SQL基础知识

（一）基本语句：SELECT、FROM、WHERE、ORDER、LIMIT 
一段SQL语言实例如下：



SELECT col1, col2
FROM table1
WHERE col3  &amp;amp;amp;gt; 5 AND col4 LIKE '%os%'
ORDER BY col5
LIMIT 10;

SELECT ：查询语句


SQL不区分大小写
真实情境很少用到DROP和CRE...]]></description><category></category></item><item><title><![CDATA[SQL基础知识]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/80614695</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/80614695</guid><author>draper__QYT</author><pubDate>Thu, 07 Jun 2018 20:23:43 +0800</pubDate><description><![CDATA[SQL基础知识

EDR  
SELECT 查询语句 
SQL不区分大小写 
真实情境很少用到DROP和CREATE语句，需要很高的权限，往往数据管理员才可以

每个 SQL 查询 
每个查询至少有一个 SELECT 和 FROM 语句。 SELECT 语句用于放置要显示数据的列。FROM语句用于放置要从中提取数据的表。

SELECT *  
FROM orders;

大写命令（SELECT、...]]></description><category></category></item><item><title><![CDATA[线索化二叉树]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78905464</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78905464</guid><author>draper__QYT</author><pubDate>Tue, 26 Dec 2017 19:06:07 +0800</pubDate><description><![CDATA[介绍了线索二叉树，并实现了二叉树的线索化]]></description><category></category></item><item><title><![CDATA[集合覆盖]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78887130</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78887130</guid><author>draper__QYT</author><pubDate>Sun, 24 Dec 2017 20:40:20 +0800</pubDate><description><![CDATA[介绍了集合覆盖问题，用python实现了近似求解]]></description><category></category></item><item><title><![CDATA[矩阵的压缩与转置（一）]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78885665</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78885665</guid><author>draper__QYT</author><pubDate>Sun, 24 Dec 2017 16:29:01 +0800</pubDate><description><![CDATA[实现了矩阵的存储与矩阵的转置算法]]></description><category></category></item><item><title><![CDATA[字符串（二）——模式匹配（BF与KMP）]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78878290</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78878290</guid><author>draper__QYT</author><pubDate>Sat, 23 Dec 2017 09:48:24 +0800</pubDate><description><![CDATA[实现了字符串的常用匹配操作（BF算法），并介绍了改进的KMP算法实现]]></description><category></category></item><item><title><![CDATA[字符串（一）——基本操作及存储实现]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78876229</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78876229</guid><author>draper__QYT</author><pubDate>Fri, 22 Dec 2017 19:33:09 +0800</pubDate><description><![CDATA[实现了字符串，并实现了基本操作（赋值、求子串、连接字符串、求长度、清空等等）]]></description><category></category></item><item><title><![CDATA[循环队列 与 其基本操作]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78867215</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78867215</guid><author>draper__QYT</author><pubDate>Thu, 21 Dec 2017 20:01:26 +0800</pubDate><description><![CDATA[实现了循环队列，并介绍了循环队列的一些基础知识；最后介绍了循环队列的实际应用，编写电脑的缓冲区]]></description><category></category></item><item><title><![CDATA[队列的实现与基本操作]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78865252</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78865252</guid><author>draper__QYT</author><pubDate>Thu, 21 Dec 2017 16:31:18 +0800</pubDate><description><![CDATA[用C语言实现了基于链表的队列，并实现了队列的基本操作（初始化、插入、删除）]]></description><category></category></item><item><title><![CDATA[LeetCode 20. Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78840408</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78840408</guid><author>draper__QYT</author><pubDate>Tue, 19 Dec 2017 11:03:15 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isValid(string s) {
        stack stack;
        for(int i=0;i<s.size();i++){
        	if(s[i]=='{'||s[i]=='['||s[i]=='(')
        		stack.push(s[i]);
        	else{
]]></description><category></category></item><item><title><![CDATA[栈的基本实现]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78839952</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78839952</guid><author>draper__QYT</author><pubDate>Tue, 19 Dec 2017 10:34:32 +0800</pubDate><description><![CDATA[用C实现了栈及其基本操作，实现了基于栈的8进制转换]]></description><category></category></item><item><title><![CDATA[LeetCode343 Integer Break]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78703679</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78703679</guid><author>draper__QYT</author><pubDate>Sun, 03 Dec 2017 20:03:38 +0800</pubDate><description><![CDATA[动态规划、记忆化搜索分别实现]]></description><category></category></item><item><title><![CDATA[线性表及其基本操作]]></title><link>https://blog.youkuaiyun.com/draper__QYT/article/details/78633094</link><guid>https://blog.youkuaiyun.com/draper__QYT/article/details/78633094</guid><author>draper__QYT</author><pubDate>Sat, 25 Nov 2017 17:31:11 +0800</pubDate><description><![CDATA[建立了线性表，实现了线性表的删除，插入操作，实现了归并两个线性表的归并函数。]]></description><category></category></item></channel></rss>