<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Leverage]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/abeford</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; abeford]]></copyright><item><title><![CDATA[webstorm Can't connect to repository from configured remote.]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/79914402</link><guid>https://blog.youkuaiyun.com/abeford/article/details/79914402</guid><author>abeford</author><pubDate>Thu, 12 Apr 2018 15:22:22 +0800</pubDate><description><![CDATA[WebStorm提交的时候出的问题关闭WebStorm进入电脑上项目文件夹打开.git文件夹查看config文件删除[remote &quot;orgin&quot;]及后面所包含的URL]]></description><category></category></item><item><title><![CDATA[[INS-30014] 无法检查指定的位置是否位于 CFS 上]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/78066916</link><guid>https://blog.youkuaiyun.com/abeford/article/details/78066916</guid><author>abeford</author><pubDate>Fri, 22 Sep 2017 20:59:19 +0800</pubDate><description><![CDATA[找了一下国内的帖子没有发现想要的答案
刚好看到外网有相关回答
https://community.oracle.com/message/12418185#12418185

【安装的时候不要点安装软件并创建一个基础数据库，点击先安装软件】]]></description><category></category></item><item><title><![CDATA[VISIO PAD模具]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/78033912</link><guid>https://blog.youkuaiyun.com/abeford/article/details/78033912</guid><author>abeford</author><pubDate>Tue, 19 Sep 2017 19:58:46 +0800</pubDate><description><![CDATA[链接：http://pan.baidu.com/s/1o8uUDbc 密码：kgvk
自己画了个模具，基本功能能画]]></description><category></category></item><item><title><![CDATA[python学习]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/77871316</link><guid>https://blog.youkuaiyun.com/abeford/article/details/77871316</guid><author>abeford</author><pubDate>Wed, 06 Sep 2017 20:53:51 +0800</pubDate><description><![CDATA[http://www.runoob.com/python3/python3-tutorial.html
先是这里把基础语法学了学


http://cuiqingcai.com/2556.html

跟着这位大佬学爬虫]]></description><category></category></item><item><title><![CDATA[约瑟夫环]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/53389043</link><guid>https://blog.youkuaiyun.com/abeford/article/details/53389043</guid><author>abeford</author><pubDate>Tue, 29 Nov 2016 09:32:15 +0800</pubDate><description><![CDATA[#include
#include
#define data struct name
#define size sizeof(data)
#define null 0


data
{
int num;
data *next;
};


data *q = null;
data *current = null;
data *head = null;]]></description><category></category></item><item><title><![CDATA[进制转换]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/53079314</link><guid>https://blog.youkuaiyun.com/abeford/article/details/53079314</guid><author>abeford</author><pubDate>Tue, 08 Nov 2016 13:22:02 +0800</pubDate><description><![CDATA[#include

int Num[32];
int option[32];
int reslut[32][32];

void binarySystem(int i)
{
	int num = Num[i];
	while(num)
     {
           reslut[i][i]=num%2;
           num/=2;
           i++;	
	}
}
voi]]></description><category></category></item><item><title><![CDATA[判断出栈顺序是否合法]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/53057833</link><guid>https://blog.youkuaiyun.com/abeford/article/details/53057833</guid><author>abeford</author><pubDate>Sun, 06 Nov 2016 23:46:00 +0800</pubDate><description><![CDATA[自己的代码
#include  
#include 
 
#define StackSize 1000  
typedef struct{  
    int data[StackSize];  
    // 用于指向栈顶元素  
    int top;  
}SeqStack,*Stack;  
  
void Push(Stack Ptr,int item)
{
	Ptr->data[+]]></description><category></category></item><item><title><![CDATA[双向循环链表]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/53055270</link><guid>https://blog.youkuaiyun.com/abeford/article/details/53055270</guid><author>abeford</author><pubDate>Sun, 06 Nov 2016 17:09:47 +0800</pubDate><description><![CDATA[#include
#include
#define size sizeof(struct link)
#define null 0

typedef struct link
{
	int data;
	struct link *pre;
	struct link *next;
}link;

link *p = null;
link *current = null;


void moveNext]]></description><category></category></item><item><title><![CDATA[循环链表]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/52915252</link><guid>https://blog.youkuaiyun.com/abeford/article/details/52915252</guid><author>abeford</author><pubDate>Mon, 24 Oct 2016 20:35:13 +0800</pubDate><description><![CDATA[#include
#include
#include 
#include


typedef struct Node
{
char data;
struct Node *next;
}node;


node *head=NULL;
node *p=NULL;


void creat(char c[])


{      
int i=0;]]></description><category></category></item><item><title><![CDATA[Java 异常处理]]></title><link>https://blog.youkuaiyun.com/abeford/article/details/51857555</link><guid>https://blog.youkuaiyun.com/abeford/article/details/51857555</guid><author>abeford</author><pubDate>Fri, 08 Jul 2016 02:33:09 +0800</pubDate><description><![CDATA[inputmismatchexception e
这个异常是已经有的？]]></description><category></category></item></channel></rss>