<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[coder_my_lover的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/coder_my_lover</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; coder_my_lover]]></copyright><item><title><![CDATA[选择排序]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011143</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011143</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 08:02:49 +0800</pubDate><description><![CDATA[public class SelectSort {
 public static int[] srot(int[] targe) {
  for (int i = 0; i &lt; targe.length; i++) {
   int min = i;
   for (int j = i; j &lt; targe.length; j++) {

    if (targe[j] &lt; targe[min]) {
 ...]]></description><category></category></item><item><title><![CDATA[插入排序]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011136</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011136</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 08:02:18 +0800</pubDate><description><![CDATA[import java.util.Arrays;

public class InsertSort {

 public static int[] insert(int[] targe) {

  for (int i = 0; i &lt; targe.length; i++) {
   int temp = targe[i];

   while (i &gt; 0 &amp;&amp; targe[i - 1] &gt; temp) {
 ...]]></description><category></category></item><item><title><![CDATA[选择排序]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011095</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011095</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 07:54:59 +0800</pubDate><description><![CDATA[public class SelectSort {
 public static int[] srot(int[] targe) {
  for (int i = 0; i &lt; targe.length; i++) {
   int min = i;
   for (int j = i; j &lt; targe.length; j++) {

    if (targe[j] &lt; targe[min]) {
 ...]]></description><category></category></item><item><title><![CDATA[插入排序]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011092</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011092</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 07:54:20 +0800</pubDate><description><![CDATA[public class InsertSort {

 public static int[] insert(int[] targe) {

  for (int i = 0; i &lt; targe.length; i++) {
   int temp = targe[i];

   while (i &gt; 0 &amp;&amp; targe[i - 1] &gt; temp) {
    targe[i] = targ...]]></description><category></category></item><item><title><![CDATA[冒泡排序]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011090</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011090</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 07:53:38 +0800</pubDate><description><![CDATA[public class BubbleSrot {

 public static int[] sort(int[] targe) {
  boolean flag = true;
  for (int i = targe.length - 1; i &gt; 0 &amp;&amp; flag; i--) {// 外层循环表示本次内层循环要确定的最大或最小数的位置
   flag = false; // 用来表内层循环是否发生交换，如果没有交换则说明数组已经...]]></description><category></category></item><item><title><![CDATA[60 n个骰子的点数]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011081</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011081</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 07:51:09 +0800</pubDate><description><![CDATA[package sort;

import java.util.Arrays;

public class Test60 {
 public static void main(String[] args) {
  solution(4);
 }

 public static void solution(int n) {
  int sum = 0;
  int[] s = new int[n * 6 + 1];
  solution(s, ...]]></description><category></category></item><item><title><![CDATA[59_2队列的最大值]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011077</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011077</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 07:50:04 +0800</pubDate><description><![CDATA[package sort;

import java.util.Deque;
import java.util.LinkedList;

public class Test59_2 {

 class inter {
  int value;
  int index;

  public inter(int value, int index) {
   // TODO Auto-generated constructor stub
  ...]]></description><category></category></item><item><title><![CDATA[59滑动窗口的最大值]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011073</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011073</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 07:49:07 +0800</pubDate><description><![CDATA[package sort;

import java.util.*;

public class Test59 {
 public static void main(String[] args) {
  System.out.println(maxInWindows(new int[] { 2, 3, 4, 2, 6, 2, 5, 1 }, 3));
 }

 public static ArrayList&lt;Integer&gt; maxInWindows(int[] n...]]></description><category></category></item><item><title><![CDATA[58 反转字符串]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011066</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011066</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 07:47:03 +0800</pubDate><description><![CDATA[package sort;

import java.util.Stack;

public class Test58 {
 public static void main(String[] args) {
  System.out.println(ReverseSentence2("student. a am I"));
 }

 private static String ReverseSentence3(String string) {
  // TODO A...]]></description><category></category></item><item><title><![CDATA[57_2 和为s的连续正整数序列]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011061</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/106011061</guid><author>coder_my_lover</author><pubDate>Sat, 09 May 2020 07:45:43 +0800</pubDate><description><![CDATA[package sort;

import java.util.ArrayList;

public class Test57_2 {

 public static void main(String[] args) {
  System.out.println(FindContinuousSequence(15));
 }

 public static ArrayList&lt;ArrayList&lt;Integer&gt;&gt; FindContinuousSeque...]]></description><category></category></item><item><title><![CDATA[生产者 消费者]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105913670</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105913670</guid><author>coder_my_lover</author><pubDate>Mon, 04 May 2020 10:06:03 +0800</pubDate><description><![CDATA[package sort;

import java.util.*;

public class ProducterAndConsumer {
 private final int MAX_LEN = 10;
 private volatile Queue&lt;Integer&gt; queue = new LinkedList&lt;Integer&gt;();

 clas...]]></description><category></category></item><item><title><![CDATA[使用wait()/notify()实现三线程交替输出ABC]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105913644</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105913644</guid><author>coder_my_lover</author><pubDate>Mon, 04 May 2020 10:05:03 +0800</pubDate><description><![CDATA[package sort;

public class ThreeThread {
 volatile Object lock = new Object();
 volatile Integer count = new Integer(0);

 class Thread1 extends Thread {

  @Override
  public vo...]]></description><category></category></item><item><title><![CDATA[Test57 和为s的数字]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105378748</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105378748</guid><author>coder_my_lover</author><pubDate>Wed, 08 Apr 2020 08:57:33 +0800</pubDate><description><![CDATA[package sort;

public class Test57 {

 public static void main(String[] args) {
  printnumber(new int[]{1,2,3,4,5,6,7,8,9,10},10 );
 } public static void printnumber(int[] s, int targe)...]]></description><category></category></item><item><title><![CDATA[56_2  数组中唯一出现一次的数字]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105370108</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105370108</guid><author>coder_my_lover</author><pubDate>Tue, 07 Apr 2020 17:56:09 +0800</pubDate><description><![CDATA[package sort;

import java.util.Arrays;

public class Test56_2 {

 public static void main(String[] args) {
    int[]e={3,3,3,4};
    System.out.println(getn(e));
 }

 public static...]]></description><category></category></item><item><title><![CDATA[56 数组中数字出现的次数]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105369021</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105369021</guid><author>coder_my_lover</author><pubDate>Tue, 07 Apr 2020 17:16:05 +0800</pubDate><description><![CDATA[package sort;

import javax.jws.Oneway;

public class Test56 {

 public static void main(String[] args) {
  int[] s = { 1, 1, 2, 2, 3, 3, 4, 5, 5, 6, 6, 7 };
  findSingle(s);
 }

 ...]]></description><category></category></item><item><title><![CDATA[55_2 判断平衡二叉树]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105368825</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105368825</guid><author>coder_my_lover</author><pubDate>Tue, 07 Apr 2020 17:10:03 +0800</pubDate><description><![CDATA[package sort;

public class Test55_2 {

 public static boolean isBalance(BinayTreeNode bt) {

  if (bt == null)
   return true;
  if (Math.abs(getdeepth(bt.left) - getdeepth(bt...]]></description><category></category></item><item><title><![CDATA[55二叉树的深度]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105368731</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105368731</guid><author>coder_my_lover</author><pubDate>Tue, 07 Apr 2020 17:06:33 +0800</pubDate><description><![CDATA[package sort;

public class Test55 {

 public static void main(String[] args) {
  int deepth = 1;
  BinayTreeNode root = new BinayTreeNode(1, null, null);
  makeTree(root, deepth)...]]></description><category></category></item><item><title><![CDATA[54 二叉搜索树中的第K大节点]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105368665</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105368665</guid><author>coder_my_lover</author><pubDate>Tue, 07 Apr 2020 17:04:11 +0800</pubDate><description><![CDATA[package sort;

public class Test54 {
 static int order = 0;

 public static void main(String[] args) {
  int deepth = 3;
  BinayTreeNode root = new BinayTreeNode(1, null, null);
 ...]]></description><category></category></item><item><title><![CDATA[53 1-n中缺失的数字]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105339237</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105339237</guid><author>coder_my_lover</author><pubDate>Tue, 07 Apr 2020 17:00:29 +0800</pubDate><description><![CDATA[package sort;

public class Test53_2 {
 
 public static void main(String[] args) {
  int[]a={0,1,2,3,5,6,7};
  System.out.println(getFirstDisorder2(a));
 }
 
 
 public st...]]></description><category></category></item><item><title><![CDATA[53 在排序数组中查找数字]]></title><link>https://blog.youkuaiyun.com/coder_my_lover/article/details/105339117</link><guid>https://blog.youkuaiyun.com/coder_my_lover/article/details/105339117</guid><author>coder_my_lover</author><pubDate>Mon, 06 Apr 2020 10:16:04 +0800</pubDate><description><![CDATA[package sort;

public class Test53 {

 public static void main(String[] args) {
  
  int[] s = { 1, 2, 3, 3, 3, 3, 3, 4, 5, 6 };
  System.out.println(getLast(s, 3, 0, s.length - ...]]></description><category></category></item></channel></rss>