<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Solo_sky]]></title><description><![CDATA[一只快乐的小码农......]]></description><link>https://blog.youkuaiyun.com/solo_sky</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; solo_sky]]></copyright><item><title><![CDATA[接口的幂等性设计]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/77389069</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/77389069</guid><author>solo_sky</author><pubDate>Fri, 18 Aug 2017 23:04:56 +0800</pubDate><description><![CDATA[前言    感觉最近脑子老是比较迷糊，记不住东西。因此，正好马上周末了，可以抽空写点东西，记录下最近的一些学习心得。概念    幂等广义上一般指以相同参数调用同一个接口多次，对系统内部产生的影响是一致的。比如说进行支付时，如果一次扣款操作因为某种原因调用了两次，那么理论上应该只生效一次，否则就会出现一定的风险；如何做幂等    回到刚才的场景，幂等是需要保证在对同一请求进行多次处理时不影响系统的正常]]></description><category></category></item><item><title><![CDATA[Java Web中常用的分页组件（Java端实现）]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/72599635</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/72599635</guid><author>solo_sky</author><pubDate>Sun, 21 May 2017 17:19:20 +0800</pubDate><description><![CDATA[前言好久没写Web程序了，这一段时间看了看原来师弟们做的一些程序，感觉还是有很多不足，一个比较典型的例子就是分页查询的实现，正好借着这个机会简单记录一下。分析使用场景“分页”在Web程序里非常常见，比如我们在页面上经常要展示一些列表信息，通常情况下，如果数据过多，我们在一屏上难以罗列出所有的记录，而且很多时候我们可能只是看看比较Top的一些记录，因此，在这种情况下使用“分页”查询只展示部分数据是比较]]></description><category></category></item><item><title><![CDATA[win 10 + maven + idea 15 + Hadoop 2.7.3开发环境配置]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/53707133</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/53707133</guid><author>solo_sky</author><pubDate>Sat, 17 Dec 2016 14:35:30 +0800</pubDate><description><![CDATA[前言今天想在win 10上搭一个Hadoop的开发环境，希望能够直联Hadoop集群并提交MapReduce任务，这里给出相关的关键配置。步骤关于maven以及idea的安装这里不再赘述，非常简单。
在win 10上配置Hadoop 
将Hadoop 2.7.3直接解压到系统某个位置，以我的文件名称为例，解压到E:\大数据平台\hadoop\hadoop-2.7.3中 配置HADOOP_HOME以及]]></description><category></category></item><item><title><![CDATA[Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/52449901</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/52449901</guid><author>solo_sky</author><pubDate>Tue, 06 Sep 2016 14:48:39 +0800</pubDate><description><![CDATA[You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linke]]></description><category></category></item><item><title><![CDATA[Two Sum]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/52448143</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/52448143</guid><author>solo_sky</author><pubDate>Tue, 06 Sep 2016 11:08:09 +0800</pubDate><description><![CDATA[Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution. 
Example:Given nums = [2, 7, 11,]]></description><category></category></item><item><title><![CDATA[MapReduce之WordCount]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/52293529</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/52293529</guid><author>solo_sky</author><pubDate>Tue, 23 Aug 2016 18:58:17 +0800</pubDate><description><![CDATA[package org.alipay.study.hadoop;import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.conf.Configured;
import org.apache.hadoop.fs.Path;
import org.apache.hadoop.io.LongWritable;
import]]></description><category></category></item><item><title><![CDATA[Java中的多线程(五)之死锁演示]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/51163473</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/51163473</guid><author>solo_sky</author><pubDate>Fri, 15 Apr 2016 17:33:49 +0800</pubDate><description><![CDATA[前言死锁是多线程编程里比较容易碰到的一个问题，尤其在锁嵌套情况下，极易发生互相请求锁资源而不得的情况，下面是示例。示例package base;
/**
 * 
 * @author zlb
 */
public class DeadLock {
    private static Object lockA = new Object();
    private static Object loc]]></description><category></category></item><item><title><![CDATA[剑指Offer-从尾到头打印链表]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/51075340</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/51075340</guid><author>solo_sky</author><pubDate>Wed, 06 Apr 2016 15:33:16 +0800</pubDate><description><![CDATA[题目描述输入一个链表，从尾到头打印链表每个节点的值。 输入描述:输入为链表的表头输出描述:输出为需要打印的“新链表”的表头解决方案:
  1：不使用系统api，即手动构造stack
import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> printListFromTailToHead(List]]></description><category></category></item><item><title><![CDATA[剑指Offer-替换空格]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/51073985</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/51073985</guid><author>solo_sky</author><pubDate>Wed, 06 Apr 2016 13:12:20 +0800</pubDate><description><![CDATA[题目描述 
请实现一个函数，将一个字符串中的空格替换成“%20”。例如，当字符串为We Are Happy.则经过替换之后的字符串为We%20Are%20Happy。解决方案:public class Solution {
    public String replaceSpace(StringBuffer str) {
        int nSpace = 0;
        int in]]></description><category></category></item><item><title><![CDATA[剑指Offer-二维数组中的查找]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/51073852</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/51073852</guid><author>solo_sky</author><pubDate>Wed, 06 Apr 2016 12:48:24 +0800</pubDate><description><![CDATA[题目描述在一个二维数组中，每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。请完成一个函数，输入这样的一个二维数组和一个整数，判断数组中是否含有该整数。 
输入描述:array： 待查找的二维数组 
target：查找的数字输出描述:查找到返回true，查找不到返回false解决方案:public class Solution {
    public boolean Find]]></description><category></category></item><item><title><![CDATA[Spark Streaming + Kafka整合指南]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/51064356</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/51064356</guid><author>solo_sky</author><pubDate>Wed, 06 Apr 2016 12:45:49 +0800</pubDate><description><![CDATA[前言

      翻译之官网http://spark.apache.org/docs/latest/streaming-kafka-integration.html，spark版本为1.6.1，kafka版本为2.10，由于某些部分比较绕口，所以这里并没有完全遵照官网进行翻译。

正文

      Apache Kafka是一个实现发布-订阅方式的消息系统，它可以用来实现分布式、可分区、可复制]]></description><category></category></item><item><title><![CDATA[same-tree]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/51024977</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/51024977</guid><author>solo_sky</author><pubDate>Thu, 31 Mar 2016 11:49:13 +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./**
 * Definition f]]></description><category></category></item><item><title><![CDATA[maximum-depth-of-binary-tree]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/51024854</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/51024854</guid><author>solo_sky</author><pubDate>Thu, 31 Mar 2016 11:38:27 +0800</pubDate><description><![CDATA[Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node/**
 * Definition for binary tree
 * public]]></description><category></category></item><item><title><![CDATA[single-number]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/51017724</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/51017724</guid><author>solo_sky</author><pubDate>Wed, 30 Mar 2016 17:42:43 +0800</pubDate><description><![CDATA[Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memo]]></description><category></category></item><item><title><![CDATA[k-max pooling实现]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/50807663</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/50807663</guid><author>solo_sky</author><pubDate>Sat, 05 Mar 2016 10:47:48 +0800</pubDate><description><![CDATA[使用theano实现k-max pooling，github上目前还没有找到theano的实现，自己就写了一个简单的，仿照的是keras issues里面的一个提交。由于theano在反向bp时能够自动处理array index的变化，因此本质上是很简单的。def k_max_pooling2d(data, k):
output = data[T.arange(data.shape[0]).dims]]></description><category></category></item><item><title><![CDATA[HBase-0.98集群安装]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/50806078</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/50806078</guid><author>solo_sky</author><pubDate>Fri, 04 Mar 2016 23:06:25 +0800</pubDate><description><![CDATA[前言HBase集群的安装依赖于zookeeper，因为它的root表信息要保存在zk上，因此我们需要Hadoop高可用安装时的zookeeper集群安装
将hadoop中配置文件目录中的hdfs-site.xml和core-site.xml拷贝到hbase/conf下
修改hbase-env.shexport JAVA_HOME=/usr/jdk/jdk8
//禁用hbase自带的zk
export]]></description><category></category></item><item><title><![CDATA[Hadoop 2.x高可用配置]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/50805725</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/50805725</guid><author>solo_sky</author><pubDate>Fri, 04 Mar 2016 21:50:28 +0800</pubDate><description><![CDATA[前言这两天整理了一下原来写的各种文档，准备陆陆续续全部写成博客，以防文档丢失，第一篇，使用zookeeper来实现Hadoop的高可用主机规划此处有三台主机，规划如下：主机名       IP地址              运行进程
hadoop      192.168.201.243     NameNode、ResourceManager、JournalNode、QuorumPeerMain、]]></description><category></category></item><item><title><![CDATA[Spark编程指南]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/49814199</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/49814199</guid><author>solo_sky</author><pubDate>Fri, 13 Nov 2015 10:30:38 +0800</pubDate><description><![CDATA[Spark 编程指南概览从上层来看，集群中每个Spark应用都包含一个驱动程序来运行用户的main函数并且执行不同的并行操作。Spark提供的主要抽象概念就是弹性分布式数据集(RDD)，其实就是一个数据集合分区后放在了集群的不同节点上，而且它可以被并行处理。RDD可以通过Hadoop的文件系统被创建(或者任何其它Hadoop支持的文件系统)，或者是驱动程序中一个存在的Scala集合转换得到。用户可能]]></description><category></category></item><item><title><![CDATA[Spark 1.5.1快速指南]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/49582745</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/49582745</guid><author>solo_sky</author><pubDate>Mon, 02 Nov 2015 09:27:44 +0800</pubDate><description><![CDATA[Spark 1.5.1快速指南说明：本翻译基本遵照Spark的官方翻译，但是某些不太顺口的地方还是做了一下处理，请原谅我poor的外语能力。官网链接：http://spark.apache.org/docs/latest/quick-start.html使用Spark Shell进行交互分析基本操作Spark的shell提供了一种简单的方式来学习Api，同时它也是一个强大的具有交互功能的数据分析工具]]></description><category></category></item><item><title><![CDATA[Gensim Tutorials(一)]]></title><link>https://blog.youkuaiyun.com/solo_sky/article/details/49329339</link><guid>https://blog.youkuaiyun.com/solo_sky/article/details/49329339</guid><author>solo_sky</author><pubDate>Thu, 22 Oct 2015 09:44:09 +0800</pubDate><description><![CDATA[前言最近一直在看文本方面的东西，虽然好理解，但是总感觉缺了点什么，意外中发现了一个不错的开源工具包gensim，它是基于python的文本挖掘工具，主要是topic model的实现，粗看了一下，感觉非常方便，所以就想学习一下这个工具，本文档主要是对Tutorials中的代码进行了注释，以备以后使用。From Strings to Vectors#文档内容，每一行就是一篇文档
documents =]]></description><category></category></item></channel></rss>