<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wangwei86609的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wangwei86609</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wangwei86609]]></copyright><item><title><![CDATA[java.util.ConcurrentModificationException 异常]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/81297175</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/81297175</guid><author>wangwei86609</author><pubDate>Tue, 31 Jul 2018 10:21:56 +0800</pubDate><description><![CDATA[
    public static void main(String[] args) {
        ArrayList&amp;lt;String&amp;gt; aList = new ArrayList&amp;lt;String&amp;gt;();
        aList.add(&quot;bbc&quot;);
        aList.add(&quot;abc&quot;);
        aList.add(&quot;ysc&quot;);
     ...]]></description><category></category></item><item><title><![CDATA[C语言数据结构-顺序队列-数组实现]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/76689029</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/76689029</guid><author>wangwei86609</author><pubDate>Fri, 04 Aug 2017 16:43:11 +0800</pubDate><description><![CDATA[#include 
#include 

typedef struct SQueue{
    int * data;
    int front,rear;
    int maxSize;
} SQueue;

void initQueue(SQueue *queue, int size){
    queue->front=0;
    queue->rear=0;
    queue->m]]></description><category></category></item><item><title><![CDATA[C语言数据结构-栈-数组实现]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/76358967</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/76358967</guid><author>wangwei86609</author><pubDate>Sat, 29 Jul 2017 22:08:41 +0800</pubDate><description><![CDATA[#include 
#include 
#define DEFAULT_SIZE 50


typedef struct ArrayStack{
    int *dataArray;
    int top;
    int size;
}ArrayStack, *PArrayStack;

PArrayStack init(){
    PArrayStack pStack=(PArraySt]]></description><category></category></item><item><title><![CDATA[C语言数据结构-栈-链表实现]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/76358628</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/76358628</guid><author>wangwei86609</author><pubDate>Sat, 29 Jul 2017 21:22:59 +0800</pubDate><description><![CDATA[栈头文件：
#ifndef LINKSTACK_H_INCLUDED
#define LINKSTACK_H_INCLUDED
typedef struct Node{
    int data;
    struct Node *next;
}Node, *PNode;

typedef struct LinkStack{
    PNode top;
}LinkStack, *PLinkSt]]></description><category></category></item><item><title><![CDATA[C语言数据结构-线性表-双链表实现]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/76037523</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/76037523</guid><author>wangwei86609</author><pubDate>Mon, 24 Jul 2017 20:11:31 +0800</pubDate><description><![CDATA[#include
#include

//线性表，双链表实现，双链表可以快速实现逆序，在某个节点可以实现向前和向后的查找
typedef struct Node{
    int data;
    struct node *prior;
    struct node *next;
}Node, *List;

Node* createNewNode(int data);

List init(]]></description><category></category></item><item><title><![CDATA[Apache 占位符工具类]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/75669885</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/75669885</guid><author>wangwei86609</author><pubDate>Fri, 21 Jul 2017 18:04:10 +0800</pubDate><description><![CDATA[记录一下占位符替换工具使用经验，废话不多说了，看下面的例子：





引入如下的dependency:

        
            org.apache.commons
            commons-lang3
            3.4
        




使用方法：

import java.util.HashMap;
imp]]></description><category></category></item><item><title><![CDATA[C语言数据结构-线性表-单链表]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/75449001</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/75449001</guid><author>wangwei86609</author><pubDate>Wed, 19 Jul 2017 20:19:34 +0800</pubDate><description><![CDATA[#include
#include


typedef struct LNode{
    int num;
    struct LNode *next;


}LNode, *LNodeList;


LNodeList init(){
  LNodeList lList=(LNodeList)malloc(sizeof(struct LNode));
  lList->num=0;
  lL]]></description><category></category></item><item><title><![CDATA[C语言数据结构-线性表-数组]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/75328220</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/75328220</guid><author>wangwei86609</author><pubDate>Tue, 18 Jul 2017 19:44:18 +0800</pubDate><description><![CDATA[#include 
#include 
#define MAX_SIZE 100

typedef struct List{
    int *data;
    int size;
} List;


void init(List *list){
    //一维数组分配内存空间
    list->data=(int *)malloc(sizeof(int)*MAX_SIZE);
    li]]></description><category></category></item><item><title><![CDATA[最简单Mybatis代码生成器]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/75091544</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/75091544</guid><author>wangwei86609</author><pubDate>Thu, 13 Jul 2017 20:06:52 +0800</pubDate><description><![CDATA[最近项目中使用了Mybatis, 顺便整理一下mybatis代码生成器使用经验。网上的好多资料，不能拿来就用，需要费一番功夫，感觉甚是不方便，所以结合自己的经验总结了一个简单入门版本
1，创建一个简单Maven工程，引入如下POM文件：
        
        
            mysql
            mysql-connector-java]]></description><category></category></item><item><title><![CDATA[Osmanthus 规则+流程引擎]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/74552419</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/74552419</guid><author>wangwei86609</author><pubDate>Thu, 06 Jul 2017 15:22:49 +0800</pubDate><description><![CDATA[规则和流程引擎框架Osmanthus, 经过几番修改和升级后，同学们终于可以从Maven中央仓库下载对应的Jar包了，Osmanthus是一款轻量级规则和流程引擎框架，支持子流程，并行流程，和比较复杂的决策树规则等。基于XML配置，和MVEL技术，扩展性和升级改造空间大。

最新文档和代码见github:https://github.com/wangwei86609/osmanthus]]></description><category></category></item><item><title><![CDATA[Osmanthus 规则引擎1.0发布了]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/84903103</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/84903103</guid><author>wangwei86609</author><pubDate>Sun, 02 Jul 2017 23:13:45 +0800</pubDate><description><![CDATA[
Osmanthus 是什么？
 Osmanthus 是一款JAVA实现的轻量级开源的规则引擎框架，它是基于MVEL组件实现的，相比drools使用更容易且更轻量级；支持复杂的规则集，例如：决策树，评分卡等；配置规则可以像配置流程一样；支持规则的并行的执行。
 
源码地址：https://github.com/wangwei86609/osmanthus
 
另注：该框架还在持续更新中...]]></description><category></category></item><item><title><![CDATA[好文章]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/84758592</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/84758592</guid><author>wangwei86609</author><pubDate>Mon, 28 Dec 2015 11:17:18 +0800</pubDate><description><![CDATA[http://blog.youkuaiyun.com/sxhelijian/article/category/5757113/5
http://blog.youkuaiyun.com/column/details/cpponline.html?&amp;page=3]]></description><category></category></item><item><title><![CDATA[Stack 表达式计算]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/84756623</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/84756623</guid><author>wangwei86609</author><pubDate>Tue, 15 Dec 2015 17:26:25 +0800</pubDate><description><![CDATA[package com.citi.ww03140.ds.exp;

import java.util.HashMap;
import java.util.Stack;

/*
3. 后缀表达式
后缀表达式也称为逆波兰式（Reverse Polish Notation, RPN），更加广为人知一些，和前缀表达式刚好相反，是将操作符号放置于操作数之后，比如2 + 3 * (5 - 1)用...]]></description><category></category></item><item><title><![CDATA[数据结构-迷宫算法-java实现]]></title><link>https://blog.youkuaiyun.com/wangwei86609/article/details/84756619</link><guid>https://blog.youkuaiyun.com/wangwei86609/article/details/84756619</guid><author>wangwei86609</author><pubDate>Tue, 15 Dec 2015 17:20:53 +0800</pubDate><description><![CDATA[package com.citi.ww03140.ds.maze;

public class Cell {

    private int i;

    private int j;

    public int getI() {
        return i;
    }

    public void setI(int i) {
        this...]]></description><category></category></item></channel></rss>