<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[illegalplayer1的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/illegalplayer1</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; illegalplayer1]]></copyright><item><title><![CDATA[字符串 数组]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52905871</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52905871</guid><author>illegalplayer1</author><pubDate>Sun, 23 Oct 2016 23:16:05 +0800</pubDate><description><![CDATA[1、字节数组转换为字符串

byte[] byBuffer = new byte[20];
... ...
String strRead = new String(byBuffer);
strRead = String.copyValueOf(strRead.toCharArray(), 0, byBuffer.length]);

2、字符串转换成字节数组

byte[] by]]></description><category></category></item><item><title><![CDATA[介绍四大接口及其实现类。]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52673825</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52673825</guid><author>illegalplayer1</author><pubDate>Mon, 26 Sep 2016 20:55:24 +0800</pubDate><description><![CDATA[下面就一一介绍四大接口及其实现类。

 

       Set接口。set集合不允许包含相同的元素。set判断两个对象是否相同是根据equals方法。如果两个对象用equals方法返回的是true，set不会接受这两个对象。

       HashSet是set接口的典型实现，HashSet按hash算法来存储集合中的元素。因此具有很好的存储和查找性能。HashSet判断两个元素的]]></description><category></category></item><item><title><![CDATA[MP3切割合并]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52652832</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52652832</guid><author>illegalplayer1</author><pubDate>Sat, 24 Sep 2016 19:15:43 +0800</pubDate><description><![CDATA[package sequenceinputstream;


import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import ja]]></description><category></category></item><item><title><![CDATA[缓冲字符流 用户登陆]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52629479</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52629479</guid><author>illegalplayer1</author><pubDate>Thu, 22 Sep 2016 23:25:47 +0800</pubDate><description><![CDATA[package bufferedwriter;


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.Fil]]></description><category></category></item><item><title><![CDATA[IOException 处理]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52613644</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52613644</guid><author>illegalplayer1</author><pubDate>Wed, 21 Sep 2016 21:34:23 +0800</pubDate><description><![CDATA[package io;


import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;


//需求：拷贝一张图片
public cl]]></description><category></category></item><item><title><![CDATA[字符串 treeset 转化]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52486654</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52486654</guid><author>illegalplayer1</author><pubDate>Fri, 09 Sep 2016 14:19:38 +0800</pubDate><description><![CDATA[package com.conpany.treeset;import java.util.Iterator; 
import java.util.TreeSet;public class Demo2 { 
    public static void main(String[] args) { 
        String str=”2 10 15 7 8”;//要按字符串大小排序    //先取]]></description><category></category></item><item><title><![CDATA[treeSet 对于对象的有序添加]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52478682</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52478682</guid><author>illegalplayer1</author><pubDate>Thu, 08 Sep 2016 23:47:21 +0800</pubDate><description><![CDATA[package com.conpany.treeset;


import java.util.TreeSet;


//tree 能够按照自然顺序排序
//tree set 在对于无自然顺序的元素排序时要实现 comparable 接口


class Emp implements Comparable{
String name;
int id;
int salary;]]></description><category></category></item><item><title><![CDATA[hashSet 防重复 之改写]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52476330</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52476330</guid><author>illegalplayer1</author><pubDate>Thu, 08 Sep 2016 23:16:26 +0800</pubDate><description><![CDATA[package com.conpany.hashset;


import java.util.HashSet;
import java.util.Scanner;


//需求： 以hashset 保存用户名密码 同用户名和密码无法注册
class User{
String name;
String password;

public User(String name,S]]></description><category></category></item><item><title><![CDATA[各种排序算法的分析及java实现]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52473739</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52473739</guid><author>illegalplayer1</author><pubDate>Thu, 08 Sep 2016 17:45:04 +0800</pubDate><description><![CDATA[各种排序算法的分析及java实现





　　排序一直以来都是让我很头疼的事，以前上《数据结构》打酱油去了，整个学期下来才勉强能写出个冒泡排序。由于下半年要准备工作了，也知道排序算法的重要性（据说是面试必问的知识点），所以又花了点时间重新研究了一下。

　　排序大的分类可以分为两种：内排序和外排序。在排序过程中，全部记录存放在内存，则称为内排序，如果排序过程中需要使用外存，则称为]]></description><category></category></item><item><title><![CDATA[HashSet 非重元素的拒绝添加]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52473651</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52473651</guid><author>illegalplayer1</author><pubDate>Thu, 08 Sep 2016 17:35:51 +0800</pubDate><description><![CDATA[package com.conpany.hashset;import java.util.HashSet;class Person{ 
    String name; 
    int id;public Person(String name,int id){
    this.id=id;
    this.name=name;}
@Override
public String toString]]></description><category></category></item><item><title><![CDATA[java 大排序]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52472600</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52472600</guid><author>illegalplayer1</author><pubDate>Thu, 08 Sep 2016 16:12:33 +0800</pubDate><description><![CDATA[Java实现几种常见排序方法日常操作中常见的排序方法有：冒泡排序、快速排序、选择排序、插入排序、希尔排序，甚至还有基数排序、鸡尾酒排序、桶排序、鸽巢排序、归并排序等。冒泡排序是一种简单的排序算法。它重复地走访过要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。走访数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。这个算法的名字由来是因为越小的元素会经由交换慢慢“]]></description><category></category></item><item><title><![CDATA[poker1]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52471560</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52471560</guid><author>illegalplayer1</author><pubDate>Thu, 08 Sep 2016 14:55:51 +0800</pubDate><description><![CDATA[package com.conpany.linkedlist;import java.util.ArrayList; 
import java.util.Collection; 
import java.util.LinkedList; 
import java.util.Random;/* 
 *  
 * use LinkedList 
 * 模拟一副扑克牌 并有洗牌功能 
 */ 
class]]></description><category></category></item><item><title><![CDATA[ArrayList 去重复]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52461483</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52461483</guid><author>illegalplayer1</author><pubDate>Wed, 07 Sep 2016 17:23:20 +0800</pubDate><description><![CDATA[package com.conpany.list;import java.util.ArrayList; 
import java.util.ListIterator;//定义一个函数清楚重复元素 思路拿一个新篮子 跟就篮子比较 
public class Demo4 { 
    public static void main(String[] args) { 
        ArrayList]]></description><category></category></item><item><title><![CDATA[迭代器的小用法]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52454852</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52454852</guid><author>illegalplayer1</author><pubDate>Tue, 06 Sep 2016 23:36:46 +0800</pubDate><description><![CDATA[package thread;


import java.nio.file.attribute.UserPrincipalLookupService;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.Scanner;


/]]></description><category></category></item><item><title><![CDATA[迭代器 基本操作]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52450570</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52450570</guid><author>illegalplayer1</author><pubDate>Tue, 06 Sep 2016 15:42:53 +0800</pubDate><description><![CDATA[package com.conpany.iterator;import java.util.ArrayList; 
import java.util.Collection; 
import java.util.Iterator;public class Demo2 {public static void main(String[] args) {
    Collection c = new Arr]]></description><category></category></item><item><title><![CDATA[多态]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52447968</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52447968</guid><author>illegalplayer1</author><pubDate>Tue, 06 Sep 2016 10:52:45 +0800</pubDate><description><![CDATA[package com.conpany.iterator;
//多态 工人赚钱


interface Money{
public void MakeMoney();
}
class Worker implements Money{


@Override
public void MakeMoney() {
System.out.println("工人赚钱");
}
]]></description><category></category></item><item><title><![CDATA[thread daemon]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52441020</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52441020</guid><author>illegalplayer1</author><pubDate>Mon, 05 Sep 2016 16:05:45 +0800</pubDate><description><![CDATA[package thread;public class DaemonThread extends Thread{DaemonThread(String name){
    super(name);
}
@Override
public void run() {
    for(int i=1;i<=100;i++){
        System.out.println("更新包下载中"+i+"%]]></description><category></category></item><item><title><![CDATA[Thread join]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52441012</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52441012</guid><author>illegalplayer1</author><pubDate>Mon, 05 Sep 2016 16:05:18 +0800</pubDate><description><![CDATA[package thread;class Mom extends Thread { 
    @Override 
    public void run() { 
        System.out.println(“做饭”); 
        Son s = new Son(); 
        s.start(); 
        try { 
            s.join()]]></description><category></category></item><item><title><![CDATA[线程的通知和交流]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52433003</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52433003</guid><author>illegalplayer1</author><pubDate>Sun, 04 Sep 2016 16:13:32 +0800</pubDate><description><![CDATA[package thread;class Product extends Thread { 
    String name; 
    double price; 
    boolean flag = false; 
}class Producer extends Thread { 
    Product p;Producer(Product p) {
    this.p = p;
}@Ov]]></description><category></category></item><item><title><![CDATA[重写eclipse 操作]]></title><link>https://blog.youkuaiyun.com/illegalplayer1/article/details/52412891</link><guid>https://blog.youkuaiyun.com/illegalplayer1/article/details/52412891</guid><author>illegalplayer1</author><pubDate>Fri, 02 Sep 2016 12:14:45 +0800</pubDate><description><![CDATA[右键点击]]></description><category></category></item></channel></rss>