<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sar31的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sar31</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sar31]]></copyright><item><title><![CDATA[JanusGraph启动ES报错：Unable to determine Elasticsearch server version. Default to FIVE.]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/102847868</link><guid>https://blog.youkuaiyun.com/sar31/article/details/102847868</guid><author>sar31</author><pubDate>Thu, 31 Oct 2019 23:17:05 +0800</pubDate><description><![CDATA[问题描述：启动janusgraph连接elasticsearch报错


1360 [main] INFO  org.janusgraph.diskstorage.Backend  - Configuring index [search]
4351 [main] WARN  org.janusgraph.diskstorage.es.rest.RestElasticSearchClient  - ...]]></description><category></category></item><item><title><![CDATA[windows环境下启动JanusGraph，gremlin-server.bat报错找不到或无法加载主类 Files\Java\jdk1.8.0_152\lib;C:\Program]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/102847486</link><guid>https://blog.youkuaiyun.com/sar31/article/details/102847486</guid><author>sar31</author><pubDate>Thu, 31 Oct 2019 22:52:17 +0800</pubDate><description><![CDATA[问题描述：windows环境下启动JanusGraph安装文件bin目录下的gremlin-server.bat或gremlin.bat,报错，

错误: 找不到或无法加载主类 Files\Java\jdk1.8.0_152\lib;C:\Program

解决方法：参考windows下kafka启动报错找不到或无法加载主类Files\Java\jdk1.8.0_144\lib\dt.jar;C:...]]></description><category></category></item><item><title><![CDATA[win10系统 64位 安装MySQL-5.7.20]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/78993777</link><guid>https://blog.youkuaiyun.com/sar31/article/details/78993777</guid><author>sar31</author><pubDate>Sun, 07 Jan 2018 11:38:50 +0800</pubDate><description><![CDATA[使用安装版本 mysql-5.7.20
1. mysql-5.7.20版本解压缩后里面没有my.ini文件，需要自己创建该文件，并创建data空文件夹
my.ini
------------------------------------------------------------------------------------------------------------------]]></description><category></category></item><item><title><![CDATA[leetcode 链表相关算法题]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/52086905</link><guid>https://blog.youkuaiyun.com/sar31/article/details/52086905</guid><author>sar31</author><pubDate>Mon, 01 Aug 2016 16:35:37 +0800</pubDate><description><![CDATA[package linkedlist;


import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashSet;
import java.util.List;
import jav]]></description><category></category></item><item><title><![CDATA[Count Numbers with Unique Digits java解法]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/52043200</link><guid>https://blog.youkuaiyun.com/sar31/article/details/52043200</guid><author>sar31</author><pubDate>Wed, 27 Jul 2016 10:36:10 +0800</pubDate><description><![CDATA[Question: 


Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.

Example:
Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤]]></description><category></category></item><item><title><![CDATA[最大堆和最小堆求数据流中的中位数【java实现】]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51315988</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51315988</guid><author>sar31</author><pubDate>Wed, 04 May 2016 16:25:36 +0800</pubDate><description><![CDATA[﻿﻿
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
public class FindMedianInStream {
 
 private static class Heap{
  //堆中元素存放的集合
  private List data;
  //比较器
]]></description><category></category></item><item><title><![CDATA[递归与非递归方式判断二叉树是否对称&& 按行打印二叉树【java实现】]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51282950</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51282950</guid><author>sar31</author><pubDate>Fri, 29 Apr 2016 16:50:20 +0800</pubDate><description><![CDATA[import java.util.LinkedList;
import java.util.Stack;
public class MirrorTree {
 
 private static class Node{
  int data;
  Node leftNode;
  Node rightNode;
  public Node(int data){
   thi]]></description><category></category></item><item><title><![CDATA[二叉树的实现&&递归和非递归方式前序、中序、后续遍历&&发现一个节点中序遍历的下一节点]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51282583</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51282583</guid><author>sar31</author><pubDate>Fri, 29 Apr 2016 16:08:23 +0800</pubDate><description><![CDATA[﻿﻿
import java.util.LinkedList;
import java.util.List;
import java.util.Stack;
public class FindNextNode {
 private int [] a ={1,2,3,4,5,6,7,8,9};
 private static List nodeList=null;
 
 //内部类 ]]></description><category></category></item><item><title><![CDATA[《剑指offer》java实现 输入n个数，找到其中最小的K个数]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51251119</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51251119</guid><author>sar31</author><pubDate>Tue, 26 Apr 2016 15:52:22 +0800</pubDate><description><![CDATA[思路一：借助快排中的partition思想，需要改动输入数组，时间复杂度O(n)
public class MinK {
 public static void main(String[] args) {
  int a[]={4,5,1,6,2,7,3,8};
  int k=5;
  int b[]=getmink(a, k);
  for(int i=0;i
   System]]></description><category></category></item><item><title><![CDATA[《剑指Offer》java实现 数组中出现数字超过1半的数字]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51243476</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51243476</guid><author>sar31</author><pubDate>Mon, 25 Apr 2016 16:52:43 +0800</pubDate><description><![CDATA[﻿﻿
import java.util.ArrayList;
public class OccurenceMoreThanOneHalf {
 public static void main(String[] args) {
  int a[]={1,2,2,2,2,3,5,4,2,2};
  getoccurencymorethanonehalf(a); 
 }
 
 //判断数]]></description><category></category></item><item><title><![CDATA[java实现 二叉树的深度&判断二叉树是否是平衡二叉树]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51175292</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51175292</guid><author>sar31</author><pubDate>Sun, 17 Apr 2016 20:53:53 +0800</pubDate><description><![CDATA[﻿﻿
class Tree{
 int v;
 Tree left;
 Tree right;
}
public class TreeDepth {
 public static void main(String[] args) {
  int data[]={10,5,12,4,7};
  Tree t=creat(data, 0);
  System.out.println]]></description><category></category></item><item><title><![CDATA[java实现 用数组实现循环队列]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51170243</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51170243</guid><author>sar31</author><pubDate>Sat, 16 Apr 2016 21:20:06 +0800</pubDate><description><![CDATA[﻿﻿
/**
 * 数组实现循环队列
 *
 */
public class LoopQueue {
 private Object[] elements;
 int capacity;
 int head;
 int rear;
 public LoopQueue(int capacity) {
  this.elements = new Object[capacity];]]></description><category></category></item><item><title><![CDATA[归并排序 & 数组中的逆序对 【java实现】]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51170018</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51170018</guid><author>sar31</author><pubDate>Sat, 16 Apr 2016 20:43:56 +0800</pubDate><description><![CDATA[归并排序
public class MergeSort {
 public static void main(String args[]){
  int a[]={7,5,6,4,9,8,12,45,1};
  mergeSort(a);
  for(int i=0;i
   System.out.print(a[i]+" ");
  }
 }
 public static vo]]></description><category></category></item><item><title><![CDATA[二叉树中和为某一值的路径 java实现]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51169984</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51169984</guid><author>sar31</author><pubDate>Sat, 16 Apr 2016 20:38:26 +0800</pubDate><description><![CDATA[﻿﻿
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
class Tree{
 int v;
 Tree left;
 Tree right;
}
public class PathofTree {
 
 //从数组中递归创建树,i 数组中的第i个元素，返回树的根节点
]]></description><category></category></item><item><title><![CDATA[【Java版本】二分查找&数字在排序数组中出现的次数]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51169962</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51169962</guid><author>sar31</author><pubDate>Sat, 16 Apr 2016 20:35:35 +0800</pubDate><description><![CDATA[二分查找
public class Array2Serach {
 public static void main(String [] args) {
  int a[] = {1,2,3,4,5,6,7};
  int b=7;  
  System.out.println(bserach1(a,b));
 }
 //二分查找 递归方式
 public static int bs]]></description><category></category></item><item><title><![CDATA[二进制中1的个数 & 打印1到最大的n位数 Java实现]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51083085</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51083085</guid><author>sar31</author><pubDate>Thu, 07 Apr 2016 09:48:47 +0800</pubDate><description><![CDATA[﻿﻿
二进制中1的个数
public class CountOne {
 public static void main(String[] args) {
  System.out.println(getonenumber(10));
 }
 
 public static int getonenumber(int n){
  int k=0;
  for(k=0;n>0;k++]]></description><category></category></item><item><title><![CDATA[裴波那契数列 java实现]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51076345</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51076345</guid><author>sar31</author><pubDate>Wed, 06 Apr 2016 16:50:20 +0800</pubDate><description><![CDATA[﻿﻿
public class Fibonacci {
 public static void main(String[] args) {
  for(int i=0;i
   System.out.println(getfibonacci(i));
  }  
 }
 
 public static long getfibonacci(int n){ 
  if(n==0){]]></description><category></category></item><item><title><![CDATA[旋转数组的最小数字 Java版实现 迭代方式]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51066455</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51066455</guid><author>sar31</author><pubDate>Tue, 05 Apr 2016 17:25:48 +0800</pubDate><description><![CDATA[﻿﻿
public class RoateMin {
 public static void main(String[] args) {
  int a[]={3,4,5,1,2};
        System.out.println(bgetmin(a));
 }
 
 //依次比较得到最小值
 public static int getmin(int a[]){
  if(]]></description><category></category></item><item><title><![CDATA[《剑指offer》用两个队列实现栈 Java版实现]]></title><link>https://blog.youkuaiyun.com/sar31/article/details/51065028</link><guid>https://blog.youkuaiyun.com/sar31/article/details/51065028</guid><author>sar31</author><pubDate>Tue, 05 Apr 2016 15:19:45 +0800</pubDate><description><![CDATA[﻿﻿
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;
public class QueneImplementByTwoStacks {
 public static void main(String[] args) {
  Scan]]></description><category></category></item></channel></rss>