<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[StormMaybin的博客]]></title><description><![CDATA[just code it]]></description><link>https://blog.youkuaiyun.com/StromMaybin</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; StromMaybin]]></copyright><item><title><![CDATA[一个极具极客范的命令行翻译工具jadetrans]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/87902140</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/87902140</guid><author>StromMaybin</author><pubDate>Sun, 24 Feb 2019 13:01:00 +0800</pubDate><description><![CDATA[
A very geeky command line translation tool.
   

Features

 Chinese &amp;lt;=&amp;gt; English
 Speech
 Others language support
 Google translation engine

Installation
Go

go get -u github.com/archervanderwa...]]></description><category></category></item><item><title><![CDATA[那些年我造的轮子之RPC]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/79830346</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/79830346</guid><author>StromMaybin</author><pubDate>Thu, 05 Apr 2018 23:29:18 +0800</pubDate><description><![CDATA[
  @author stormma 
  @date 2018/04/05





  声明不息，奋斗不止




storm-rpc



快速开始(使用Spring Boot)



Api

接口IHelloService.java



package me.stormma.api;

/**
 * @author stormma stormmaybin@gmail.com
 */
p...]]></description><category></category></item><item><title><![CDATA[字符串匹配问题算法总结]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/79679434</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/79679434</guid><author>StromMaybin</author><pubDate>Sat, 24 Mar 2018 16:47:56 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2018/03/24





  生命不息，奋斗不止








题目1



Implement wildcard pattern matching with support for '?' and '*'.

'?' Matches any single character.
'*' Matches any sequence of ...]]></description><category></category></item><item><title><![CDATA[leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/79669631</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/79669631</guid><author>StromMaybin</author><pubDate>Fri, 23 Mar 2018 16:40:31 +0800</pubDate><description><![CDATA[
  生命不息，奋斗不止





  @author stormma 
  @date 2018/03/23




Given inorder and postorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.
...]]></description><category></category></item><item><title><![CDATA[leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/79669228</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/79669228</guid><author>StromMaybin</author><pubDate>Fri, 23 Mar 2018 16:20:58 +0800</pubDate><description><![CDATA[
  生命不息，奋斗不止





  @author stormma 
  @date 2018/03/23


Given preorder and inorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

Fo...]]></description><category></category></item><item><title><![CDATA[再见我的2017]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78947286</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78947286</guid><author>StromMaybin</author><pubDate>Mon, 01 Jan 2018 20:48:45 +0800</pubDate><description><![CDATA[生命不息，奋斗不止!
  
  @author stormma 
  @date 2017/12/31
每每在这年度”交接”的时候, 我总会去回想一下过去一年我的”得失”, 以便来年此时我可以骄傲得对自己说, 你没有辜负时间, 时间也没有辜负你! 所谓你没有辜负时间, 即是过去一年努力过, 所谓时间没有辜负你, 恰也说明你收获了与付出成正比的结果!我不想每次写年度总结的时候, 一半篇幅的文字都在感慨]]></description><category></category></item><item><title><![CDATA[Leetcode 41. First Missing Positive]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78673162</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78673162</guid><author>StromMaybin</author><pubDate>Thu, 30 Nov 2017 10:32:26 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/11/30  生命不息，奋斗不止！
题目Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,
and [3,4,-1,1] return 2.Your algorithm sho]]></description><category></category></item><item><title><![CDATA[Leetcode Combinations问题总结]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78672396</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78672396</guid><author>StromMaybin</author><pubDate>Thu, 30 Nov 2017 09:40:37 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/11/30  生命不息，奋斗不止！
题目1Given two integers n and k, return all possible combinations of k numbers out of 1 … nExample 
n = 4, k = 2            [2,4],
            [3,4],]]></description><category></category></item><item><title><![CDATA[Leetcode 98.Validate Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78660524</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78660524</guid><author>StromMaybin</author><pubDate>Tue, 28 Nov 2017 23:22:49 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/11/28  生命不息，奋斗不止！
题目Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:
The left subtree of a node contains only n]]></description><category></category></item><item><title><![CDATA[Java NIO初探(一)]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78597056</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78597056</guid><author>StromMaybin</author><pubDate>Tue, 21 Nov 2017 21:16:31 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017-11-19  生命不息，奋斗不止
前言NIO(Non-Blocking IO), 现称为非阻塞IO, 早期曾被解释为New-IO, 相比于BIO(Blocking IO)来说，NIO是非阻塞的, 举个很简单的例子, 就是一个线程可以管理多个连接, 这较BIO来有什么进步的地方呢? 假如现在有个聊天服务器, 使用BIO通信的形式, 我们往往是]]></description><category></category></item><item><title><![CDATA[一点一滴探究JVM之内存结构]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78546849</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78546849</guid><author>StromMaybin</author><pubDate>Thu, 16 Nov 2017 08:30:05 +0800</pubDate><description><![CDATA[@date 2017/11/15 
  @author stormma  生命不息，奋斗不止
前言我一直尝试着用不一样的文字来写博客！原因很简单，你讲的知识书上都有，那么每个人为什么不选择看书而选择看你的博文来学习呢？因为书上的内容都是大片大片描述性的文字，对于jvm这块的知识，又是异常枯燥，但又不能不学习的硬骨头！这恰好也就能说明Head First系列的书籍为什么比较火的原因，每个人接收图形知识]]></description><category></category></item><item><title><![CDATA[一点一滴探究JVM之类加载机制]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78540196</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78540196</guid><author>StromMaybin</author><pubDate>Wed, 15 Nov 2017 14:07:58 +0800</pubDate><description><![CDATA[@date 2017/11/14 
  @author stormma  生命不息，奋斗不止
前言一点一滴探究JVM系列，主要深入探究JVM运行机制。俗话说，知其然知其所以然。如果不懂JVM的运行机制，那么无法了解Java这门语言最核心的东西， 
也就谈不上编程之美了，因为你根本不懂得如何使你的代码更优雅。废话不多说，今天的主题就是JVM的类加载机制！开始之前
  在正式开始之前，我们先来看一段小程]]></description><category></category></item><item><title><![CDATA[一道题看清动态规划的前世今生(一)]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78509420</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78509420</guid><author>StromMaybin</author><pubDate>Sat, 11 Nov 2017 23:11:10 +0800</pubDate><description><![CDATA[@author: StormMa 
  @date 2017-11-11  生命不息，奋斗不止
前言本篇文章旨在用通俗简单的语言来教你入门动态规划。动态规划是算法中很重要的一块内容，在各大公司的笔试算法中占据大壁江山，所以，掌握动态规划是你拿到称心的offer的前提，废话不多说，让我们来开始一段算法之旅吧。在开始之前，你要努力忘掉你理解的动态规划，因为有可能那些都是错误的，会限制你的思路。相信我，读]]></description><category></category></item><item><title><![CDATA[Leetcode刷题记]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78483938</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78483938</guid><author>StromMaybin</author><pubDate>Wed, 08 Nov 2017 22:04:04 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/11/08  生命不息，奋斗不止！
前言
  一个假acmer的重拾算法之路
算法是程序员的基本功，基本功的扎实程度一定上决定了你能走多远。前两年，急于学招式，招式学得差不多了，可是错过了大好的学习算法，练基本功的机会。不知不觉进入这个行业也两年多了，这两年基本上都在围绕着Javaweb做事，也算是有所收获吧，从一个接一个的业务项目，到后面]]></description><category></category></item><item><title><![CDATA[leetcode 10. Regular Expression Matching]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78461125</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78461125</guid><author>StromMaybin</author><pubDate>Mon, 06 Nov 2017 19:54:51 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/11/06  生命不息，奋斗不止
题目Implement regular expression matching with support for '.'and '*'.'.' Matches any single character.
'*' Matches zero or more of the preceding element.Th]]></description><category></category></item><item><title><![CDATA[leetcode 4.median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78453636</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78453636</guid><author>StromMaybin</author><pubDate>Sun, 05 Nov 2017 23:33:03 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/11/05  生命不息，奋斗不止！
** 题目 
There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity]]></description><category></category></item><item><title><![CDATA[Leetcode 18.4Sum]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78434177</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78434177</guid><author>StromMaybin</author><pubDate>Fri, 03 Nov 2017 12:07:50 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/11/03  生命不息，奋斗不止！
题目Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which]]></description><category></category></item><item><title><![CDATA[Leetcode 16. 3sum closest]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78432815</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78432815</guid><author>StromMaybin</author><pubDate>Fri, 03 Nov 2017 10:55:17 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/11/03  生命不息，奋斗不止
题目Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. Y]]></description><category></category></item><item><title><![CDATA[Leetcode 15. 3sum]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78432438</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78432438</guid><author>StromMaybin</author><pubDate>Fri, 03 Nov 2017 10:29:15 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/11/03  生命不息，奋斗不止！
题目Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of z]]></description><category></category></item><item><title><![CDATA[leetcode 29. Divide Two Integers]]></title><link>https://blog.youkuaiyun.com/StromMaybin/article/details/78361797</link><guid>https://blog.youkuaiyun.com/StromMaybin/article/details/78361797</guid><author>StromMaybin</author><pubDate>Fri, 27 Oct 2017 10:14:57 +0800</pubDate><description><![CDATA[@author stormma 
  @date 2017/10/27 10:02
–
  生命不息，奋斗不止！ 
题目Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.思路分析方案1被除数-除数，ans++，但是这样如果被除数和除]]></description><category></category></item></channel></rss>