<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Lionel]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Lionel_D</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Lionel_D]]></copyright><item><title><![CDATA[hdu 3367 Pseudoforest 伪森林 题目很难懂，模仿kruskal，并查集检查两个节点是否是一个环]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/61692883</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/61692883</guid><author>Lionel_D</author><pubDate>Sun, 12 Mar 2017 23:44:00 +0800</pubDate><description><![CDATA[Pseudoforest
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2880    Accepted Submission(s): 1129


Problem Description
In graph theory,]]></description><category></category></item><item><title><![CDATA[hdu 3792 Twin Prime Conjecture 浙大复试上机题 水题]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/61434334</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/61434334</guid><author>Lionel_D</author><pubDate>Sat, 11 Mar 2017 22:37:32 +0800</pubDate><description><![CDATA[Twin Prime Conjecture
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3211    Accepted Submission(s): 1138


Problem Description
If we de]]></description><category></category></item><item><title><![CDATA[hdu 2102 A计划  搜索简单题，防止超时，记录访问每个节点时的时间戳，选择每次访问的最小时间戳]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/61414990</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/61414990</guid><author>Lionel_D</author><pubDate>Sat, 11 Mar 2017 12:18:37 +0800</pubDate><description><![CDATA[A计划
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 20243    Accepted Submission(s): 5125


Problem Description
可怜的公主在一次次被魔王掳走一次次被骑士们救回来之]]></description><category></category></item><item><title><![CDATA[hdu 1241 Oil Deposits 搜索水题，等价于求一个图的连通分量的数目]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/61208790</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/61208790</guid><author>Lionel_D</author><pubDate>Fri, 10 Mar 2017 21:26:44 +0800</pubDate><description><![CDATA[Oil Deposits
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 28896    Accepted Submission(s): 16666


Problem Description
The GeoSurvComp]]></description><category></category></item><item><title><![CDATA[hdu 1203 01背包变形。。。一道很诡异的水题。。]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/59220648</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/59220648</guid><author>Lionel_D</author><pubDate>Thu, 02 Mar 2017 00:36:13 +0800</pubDate><description><![CDATA[I NEED A OFFER!
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26492    Accepted Submission(s): 10740


Problem Description
Speakless很早就]]></description><category></category></item><item><title><![CDATA[hdu 3790 最短路径&最低费用  题目不难，但要注意重边]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/56713312</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/56713312</guid><author>Lionel_D</author><pubDate>Fri, 24 Feb 2017 00:35:05 +0800</pubDate><description><![CDATA[最短路径问题
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 24838    Accepted Submission(s): 7408


Problem Description
给你n个点，m条无向边，每条边都有长度d和花]]></description><category></category></item><item><title><![CDATA[poj1258 Agri-Net 最小生成树水题]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/54289438</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/54289438</guid><author>Lionel_D</author><pubDate>Mon, 09 Jan 2017 15:34:02 +0800</pubDate><description><![CDATA[Agri-Net
Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 55019		Accepted: 22821
Description

Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your]]></description><category></category></item><item><title><![CDATA[struts2中怎么覆盖默认错误信息以及两种自定义类型转换器的方法]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/50593708</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/50593708</guid><author>Lionel_D</author><pubDate>Wed, 27 Jan 2016 16:08:27 +0800</pubDate><description><![CDATA[在实际开发中，覆盖默认错误信息以及自定义类型转换器还是很有必要的的。毕struts是外国人开发的，默认的一些东西都不太合我们的胃口


首先放上的index.jsp页面





  
    My JSP 'index.jsp' starting page
	
	
	    
	
	
	<!--
	
	-->
  
  <!--
  	
  	怎么覆盖struts定义的默认错误信息：
 ]]></description><category></category></item><item><title><![CDATA[javaWeb 实现上传+下载 文件]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/50216951</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/50216951</guid><author>Lionel_D</author><pubDate>Tue, 08 Dec 2015 12:26:52 +0800</pubDate><description><![CDATA[上传下载在web项目中应该是很常见的需求，能够熟练敲出代码实现是web开发人员必不可少的
下面简化的上传：
jsp页面的实现：
<%@ page language="java" import="java.util.*" pageEncoding="utf-8"%>
<%@ taglib uri = "http://java.sun.com/jsp/jstl/core"  prefix = "c" %>

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transit]]></description><category></category></item><item><title><![CDATA[javaMail发邮件的模板代码，如果你用网易邮箱的账号发送邮件失败的话，可以看看]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/50095417</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/50095417</guid><author>Lionel_D</author><pubDate>Sun, 29 Nov 2015 15:14:19 +0800</pubDate><description><![CDATA[刚开始用的邮箱账号是在网易163刚注册的号码，结果总是失败，以为是自己的代码哪里有问题，可是和别人的代码对照检查了一遍，也没找到问题，十分纠结，突然想我使用的smtp发送的邮件，我查看了网易邮箱的设置有一个POP3/SMTP/IMAP选项：

点击后:


看到这个之后顿时感觉无语。。默认竟然是关闭STMP服务！！！！
所以换了一个公司的邮箱，腾讯的邮箱发送没问题，但是接收可能存在问题，但应该不是代码的问题。



package cn.Lionel.javamail;

import java.io.Fi]]></description><category></category></item><item><title><![CDATA[关于打包自定义标签，并导入项目使用时，出现java.lang.NoClassDefFoundError: JspException异常，解决方法和注意事项！]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/49658309</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/49658309</guid><author>Lionel_D</author><pubDate>Thu, 05 Nov 2015 09:36:36 +0800</pubDate><description><![CDATA[坑死我了啊！！！！事先不知道，还以为哪里出了bug，百度这个异常可能出现的原因，都没解决，最后百度关键字“打包自定义标签库 出现异常”出现的第一个链接才解决的，Stack Overflow上也有关于这个答案，链接：http://stackoverflow.com/questions/9184500/javax-servlet-servletexception-java-lang-noclassdeffounderror-javax-servlet-se

具体方法：
1.新建一个普通的java项目，将自己写]]></description><category></category></item><item><title><![CDATA[使用jsp+javaBean写一个网页计算器]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/49471689</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/49471689</guid><author>Lionel_D</author><pubDate>Wed, 28 Oct 2015 17:07:44 +0800</pubDate><description><![CDATA[在学习jsp时写的练手的代码。
运行效果：

calculator.jsp代码：




  
    
    My JSP 'calculator.jsp' starting page
   
   
   
	   body{
		text-align : center;
	   }
		body table tr td input{
			width:100%;
			height]]></description><category></category></item><item><title><![CDATA[编译器实践五 之 构造一个支持加减乘除的栈式计算机]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/47687411</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/47687411</guid><author>Lionel_D</author><pubDate>Sun, 16 Aug 2015 19:22:51 +0800</pubDate><description><![CDATA[我的第一篇博客：编译器实践一 之 加法栈式计算机
最近学习了一点简单的Bison再加上抽象语法树，于是做了一下MOOC的留下的作业，按照要求，改了和增加了几处代码，感觉学到了很多东西。不过为了减少难度，突出侧重点，我没有去管理内存，内存泄露有点严重，代码仅供参考。
功能是输入一行或者多行算术表达式，对表达式建立抽象语法树，然后输出(主要是为了查看抽象表达式建立的是否准确)，编译，完成对栈式计算机的模拟，原来的代码不支持减法，除法，括号表达式，并且只能完成一行的编译，我把它推广到了任意行数。
下面是对抽象语法]]></description><category></category></item><item><title><![CDATA[编译器实践四 之 FIRST集合，NULLABLE集合，FOLLOW集合]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/47133321</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/47133321</guid><author>Lionel_D</author><pubDate>Wed, 29 Jul 2015 21:51:27 +0800</pubDate><description><![CDATA[闲来无事，就把龙书拿出来有看了看，把最近学的总结一下。
	
	FIRST(X)集合定义：可从X推导得到的串的首符号的集合，其中X是任意文法符号。如果X=>······=>ε ，那么ε也在FIRST(X)中。（定义来自龙书）

	算法伪代码(非准确版)：

foreach(nonterminal N)
	FIRST(N) = {}
while(some set is changing)
	foreach (production p: N->β1 … βn)
	if (β1== a …)
		FIRST(N)∪]]></description><category></category></item><item><title><![CDATA[鉴于Eclipse下在线安装Pydev插件所遇见的问题，及其替代的离线安装的方法]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/46975913</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/46975913</guid><author>Lionel_D</author><pubDate>Mon, 20 Jul 2015 23:09:54 +0800</pubDate><description><![CDATA[这几天心血来潮突然想学会Python解解闷，先是按照网上说的安装Python(x,y)，谁知道Spyder IDE用不了，可把我急坏了，原先玩cocos2dx，安装过Python2.7,于是就卸载了重新安装，，谁知道Pythonxy竟然安装了几十个库，一个一个卸载，累死我了。。可是重新安装了以后还是用不了Spyder，于是又是配各种环境变量，还是没解决，就放弃了。以前也学过JAVA，于是就在ecl]]></description><category></category></item><item><title><![CDATA[编译器实践三 之 针对算术表达式的语法分析器]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/46867461</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/46867461</guid><author>Lionel_D</author><pubDate>Mon, 13 Jul 2015 20:39:54 +0800</pubDate><description><![CDATA[部分代码来自MOOC

#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>

void parse_F();
void parse_T();
void parse_E();
void error (char *want, char got);

int i;
char *str = 0;

void error (char *want, char got)
{
  fprintf (stderr, "Compling this expressi]]></description><category></category></item><item><title><![CDATA[编译器实践 二 之 小型的词法分析器]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/46867339</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/46867339</guid><author>Lionel_D</author><pubDate>Mon, 13 Jul 2015 20:32:05 +0800</pubDate><description><![CDATA[下面是一个简单的词法分析器

#include <stdio.h>
#include <string.h>
using namespace std ;
int main()
{
	char str[150] ;
//	freopen("C:\\Users\\Lionel\\Desktop\\1.txt","r",stdin) ;
	int row = 1 , cow = 0 ;
	while(gets(str))
	{
		char temp[10] ;
		int index = 0 , i = 0;
	]]></description><category></category></item><item><title><![CDATA[编译器实践一 之 加法栈式计算机]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/46867291</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/46867291</guid><author>Lionel_D</author><pubDate>Mon, 13 Jul 2015 20:28:11 +0800</pubDate><description><![CDATA[下面是一个简单的小型加法栈式计算机

#include <stdio.h>
#include <stdlib.h>


///////////////////////////////////////////////
// Data structures for the Sum language.
enum Exp_Kind_t {EXP_INT, EXP_SUM};
struct Exp_t
{
  enum Exp_Kind_t kind;
};

struct Exp_Int
{
  enum Exp_]]></description><category></category></item><item><title><![CDATA[学习正则表达式~~~]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/46240477</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/46240477</guid><author>Lionel_D</author><pubDate>Fri, 29 May 2015 20:43:54 +0800</pubDate><description><![CDATA[短暂的ACM已经告一段落
	终于有时间做自己喜欢的做的事情了。
	想写一个编译器，看到正则表达式，就练习了一下
	首先上一些干货
	正则表达式30分钟入门教程
	上面的教程写的非常良心，值得一看。
	还有一个关于正则表达式的在线测试：正则表达式在线测试]]></description><category></category></item><item><title><![CDATA[【汇编】 冒泡排序。。。]]></title><link>https://blog.youkuaiyun.com/Lionel_D/article/details/45688627</link><guid>https://blog.youkuaiyun.com/Lionel_D/article/details/45688627</guid><author>Lionel_D</author><pubDate>Wed, 13 May 2015 09:11:03 +0800</pubDate><description><![CDATA[最近在学习汇编，也发现自己好长时间没写博客了，就更新一个昨天用汇编写的冒泡排序吧
	     上个星期五开始学的汇编，写的较挫，望见谅
	代码有bug还望提出，一起讨论]]></description><category></category></item></channel></rss>