<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[JLG678的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/JLG678</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; JLG678]]></copyright><item><title><![CDATA[java--LinkedList源码分析]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/76682713</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/76682713</guid><author>JLG678</author><pubDate>Fri, 04 Aug 2017 14:21:15 +0800</pubDate><description><![CDATA[文章转载：http://blog.youkuaiyun.com/jzhf2012/article/details/8540543


一、源码解析

    1、 LinkedList类定义。

 

public class LinkedList
     extends AbstractSequentialList
     implements List, Deque, Cloneab]]></description><category></category></item><item><title><![CDATA[java8 ArrayList源码阅读]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/76682656</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/76682656</guid><author>JLG678</author><pubDate>Fri, 04 Aug 2017 14:16:55 +0800</pubDate><description><![CDATA[转载自 java8 ArrayList源码阅读http://blog.youkuaiyun.com/angel1hao/article/details/52162115

本文基于jdk1.8

Java Collection库中有三类：List，Queue，Set

其中List，有三个子实现类：ArrayList，Vector，LinkedList

http://hg.openjdk.j]]></description><category></category></item><item><title><![CDATA[next-permutation]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/75264313</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/75264313</guid><author>JLG678</author><pubDate>Mon, 17 Jul 2017 19:14:12 +0800</pubDate><description><![CDATA[Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

If such arrangement is not possible, it must rearrange it as the lowest possible]]></description><category></category></item><item><title><![CDATA[n-queens-ii]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/75260925</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/75260925</guid><author>JLG678</author><pubDate>Mon, 17 Jul 2017 18:41:31 +0800</pubDate><description><![CDATA[Follow up for N-Queens problem.

Now, instead outputting board configurations, return the total number of distinct solutions.



可参考上一篇博客，这里只需要产生一个 可行解，就将计数器count++

import java.util.*;
public]]></description><category></category></item><item><title><![CDATA[n-queens]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/75259122</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/75259122</guid><author>JLG678</author><pubDate>Mon, 17 Jul 2017 18:31:43 +0800</pubDate><description><![CDATA[The n-queens puzzle is the problem of placing n queens on an n×nchessboard such that no two queens attack each other.



Given an integer n, return all distinct solutions to the n-queens puzzle.
]]></description><category></category></item><item><title><![CDATA[leetCode--linked-list-cycle-ii]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/74076565</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/74076565</guid><author>JLG678</author><pubDate>Sat, 01 Jul 2017 18:08:06 +0800</pubDate><description><![CDATA[Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.

Follow up:
Can you solve it without using extra space?



分析：

串长a + n，其中n为循环，当a + b步的慢指针与快指针相遇]]></description><category></category></item><item><title><![CDATA[leetCode--reorder-list]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/74076485</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/74076485</guid><author>JLG678</author><pubDate>Sat, 01 Jul 2017 17:50:39 +0800</pubDate><description><![CDATA[Given a singly linked list L: L 0→L 1→…→L n-1→L n,
reorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→…

You must do this in-place without altering the nodes' values.

For example,
Given{1,2,3,4}, reor]]></description><category></category></item><item><title><![CDATA[leetcode--max-points-on-a-line]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/74002480</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/74002480</guid><author>JLG678</author><pubDate>Fri, 30 Jun 2017 15:54:38 +0800</pubDate><description><![CDATA[Given n points on a 2D plane, find the maximum number of points that lie on the same straight line
分析：2点确定一条直线，在这个过程中，需要注意和第一个重复的点，这个点只能看成一个
public class Solution {
    public int maxPoints(Point[]]]></description><category></category></item><item><title><![CDATA[leetcode--evaluate-reverse-polish-notation]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/74001470</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/74001470</guid><author>JLG678</author><pubDate>Fri, 30 Jun 2017 15:23:35 +0800</pubDate><description><![CDATA[Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are+,-,*,/. Each operand may be an integer or another expression.

Some examples:
  ["2", "1", "+", "3"]]></description><category></category></item><item><title><![CDATA[leetCode--same-tree]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/73996690</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/73996690</guid><author>JLG678</author><pubDate>Fri, 30 Jun 2017 14:33:46 +0800</pubDate><description><![CDATA[Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.




分析：很简单，先]]></description><category></category></item><item><title><![CDATA[leetcode--symmetric-tree]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/73995881</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/73995881</guid><author>JLG678</author><pubDate>Fri, 30 Jun 2017 14:27:22 +0800</pubDate><description><![CDATA[Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree is symmetric:
    1
   / \
  2   2
 / \ / \
3  4 4  3





But the]]></description><category></category></item><item><title><![CDATA[java复习——this instanceof super关键字的用法]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/72695984</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/72695984</guid><author>JLG678</author><pubDate>Wed, 24 May 2017 19:01:25 +0800</pubDate><description><![CDATA[在Java语言中，当创建一个对象后，Java虚拟机就会为其分配一个指向对象本身的指针，这个指针就是“this”。




使用this调用本类中的成员变量（属性）使用this调用构造方法使用this引用当前对象


super 关键字与 this 类似，this 用来表示当前类的实例，super 用来表示父类。



super 可以用在子类中，通过点号(.)来获取父类的成]]></description><category></category></item><item><title><![CDATA[java复习—— static  static final  关键字的使用方式]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/72695023</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/72695023</guid><author>JLG678</author><pubDate>Wed, 24 May 2017 18:57:20 +0800</pubDate><description><![CDATA[1.     静态方法 



通常，在一个类中定义一个方法为static，那就是说，无需本类的对象即可调用此方法
声明为static的方法有以下几条限制：
它们仅能调用其他的static 方法。 
它们只能访问static数据。 
它们不能以任何方式引用this 或super

2. 静态变量

声明为static的变量实质上就是全局变量。
3．静态类

     ]]></description><category></category></item><item><title><![CDATA[进制转换，打印99乘法表]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/72672944</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/72672944</guid><author>JLG678</author><pubDate>Wed, 24 May 2017 08:43:40 +0800</pubDate><description><![CDATA[public void print99Table(){
		for(int i=1;i<=9;i++){
			for(int j=1;j<=i;j++){
				System.out.print(j+"*"+i+"="+(j*i)+"\t");
			}
			System.out.println();
		}
	}


	/*	 * in  输入的数
	 * inNum 输入的数的进制]]></description><category></category></item><item><title><![CDATA[java复习--数据类型的转换，java运算符]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/72672879</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/72672879</guid><author>JLG678</author><pubDate>Wed, 24 May 2017 08:25:49 +0800</pubDate><description><![CDATA[数据类型转换主要分为两种
1、自动类型转换

可以将一个数赋值给更大数值范围的变量，例如可以经byte 变量赋值给short变量可以将short变量赋值给int变量可以将int变量赋值给long变量。Java内部其实做了工作
就是自动将数值进行了类型提升，就叫做自动类型转换

要实现自动类型的转换，需要满足两个条件，第一两种类型彼此兼容，第二目标类型取值范围必须大于源类型。所有的数字类]]></description><category></category></item><item><title><![CDATA[java复习3——环境配置，基本知识]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/72392308</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/72392308</guid><author>JLG678</author><pubDate>Wed, 17 May 2017 15:22:54 +0800</pubDate><description><![CDATA[基本概念：
jre： java运行所需类库和JVM（java虚拟机）
jdk ：java开发工具和jre
java程序运行基本机制
java源文件（.java）编译成字节码文件（.class）   javac命令
        字节码文件经JVM执行成操作系统认识的代码 
 java命令
path配置
JAVA_HOME   jdk所在的目录（我的是D:\JAVA\JDK）
C]]></description><category></category></item><item><title><![CDATA[SSM框架之spring学习1——创建对象，处理依赖关系]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/60469461</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/60469461</guid><author>JLG678</author><pubDate>Sun, 05 Mar 2017 17:31:32 +0800</pubDate><description><![CDATA[1、  引入spring核心包
a)        commons-logging-1.1.3.jar           日志
b)        spring-beans-3.2.5.RELEASE.jar        bean节点
c)        spring-context-3.2.5.RELEASE.jar       spring上下文节点
d)        sprin]]></description><category></category></item><item><title><![CDATA[java foreach原理探讨]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/60329335</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/60329335</guid><author>JLG678</author><pubDate>Sat, 04 Mar 2017 15:59:22 +0800</pubDate><description><![CDATA[foreach的原理：
首先我们给出一个简单的例子public class Demo1 {
	public static void main(String[] args) {		
		String[] i={"0","1","2","3","4","5","6"};
		for(String j:i){
			System.out.println(j);
		}
	}
}再看看他的字节码  ja]]></description><category></category></item><item><title><![CDATA[java复习  return，break，continue关键字]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/60327080</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/60327080</guid><author>JLG678</author><pubDate>Sat, 04 Mar 2017 15:19:34 +0800</pubDate><description><![CDATA[return，break，continue 是java的关键字，相信大部分同学都知道基本用法，再次总结一下：
break、continue出现在循环结构当中，break可以终结循环，跳入下个语句，而continue功能是终结当次循环，进入下一次循环。
在此，主要强调return也可以作为终结语句。而最为重要的是，也是以前没有发现的，无论一个方法（或者函数）里面最后一条语句都是return来结束]]></description><category></category></item><item><title><![CDATA[java复习2   封装、继承、多态的理解]]></title><link>https://blog.youkuaiyun.com/JLG678/article/details/59484011</link><guid>https://blog.youkuaiyun.com/JLG678/article/details/59484011</guid><author>JLG678</author><pubDate>Thu, 02 Mar 2017 11:02:26 +0800</pubDate><description><![CDATA[封装：  为对象提供了一种隐藏内部特性和方法的能力 ，提供了一个有效的途径来保护数据不被意外的破坏。
继承： 给对象提供了一种可以获取基类方法或字段的能力 ，继承主要实现重用代码，节省开发时间   
多态： 给不同的数据类型提供一个相同的接口作为对外展示的一种能力]]></description><category></category></item></channel></rss>