<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[smart_ferry的博客]]></title><description><![CDATA[笨鸟的自学之路]]></description><link>https://blog.youkuaiyun.com/smart_ferry</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; smart_ferry]]></copyright><item><title><![CDATA[Java之jstack工具的使用]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/127603678</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/127603678</guid><author>smart_ferry</author><pubDate>Sun, 30 Oct 2022 20:33:02 +0800</pubDate><description><![CDATA[Java之jstack工具的使用]]></description><category></category></item><item><title><![CDATA[Java之文件IO]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/127471389</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/127471389</guid><author>smart_ferry</author><pubDate>Sun, 23 Oct 2022 18:52:01 +0800</pubDate><description><![CDATA[Java之文件IO]]></description><category></category></item><item><title><![CDATA[Spark之UDF失效]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/127457242</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/127457242</guid><author>smart_ferry</author><pubDate>Sat, 22 Oct 2022 10:10:50 +0800</pubDate><description><![CDATA[Spark之UDF失效]]></description><category></category></item><item><title><![CDATA[ProtoBuf之在GoLang中实现GRPC服务]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/127351467</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/127351467</guid><author>smart_ferry</author><pubDate>Sun, 16 Oct 2022 23:29:26 +0800</pubDate><description><![CDATA[ProtoBuf之在GoLang中实现GRPC服务]]></description><category></category></item><item><title><![CDATA[学习笔记之极客时间《Java 核心技术面试精讲》]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/127141868</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/127141868</guid><author>smart_ferry</author><pubDate>Sun, 02 Oct 2022 13:46:23 +0800</pubDate><description><![CDATA[学习笔记之极客时间《Java 核心技术面试精讲》]]></description><category></category></item><item><title><![CDATA[Spark优化之在大数据环境判断两个列表是否有交集]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/127023900</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/127023900</guid><author>smart_ferry</author><pubDate>Sat, 24 Sep 2022 13:58:36 +0800</pubDate><description><![CDATA[Spark优化之在大数据环境判断两个列表是否有交集]]></description><category></category></item><item><title><![CDATA[Spark读入ProtoMessage并写出为Parquet]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/126920992</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/126920992</guid><author>smart_ferry</author><pubDate>Sun, 18 Sep 2022 20:17:38 +0800</pubDate><description><![CDATA[Spark如何快速将ProtoMessage写出为Parquet]]></description><category></category></item><item><title><![CDATA[初识Protobuf]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/126915718</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/126915718</guid><author>smart_ferry</author><pubDate>Sun, 18 Sep 2022 14:11:31 +0800</pubDate><description><![CDATA[1. 初识Protobuf
2. 将proto文件编译为Java文件
3. 通过Scala模拟服务A将proto message写入文件，服务B从文件读出proto message]]></description><category></category></item><item><title><![CDATA[拷贝构造函数&重载赋值运算=]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/105456646</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/105456646</guid><author>smart_ferry</author><pubDate>Sat, 11 Apr 2020 19:21:11 +0800</pubDate><description><![CDATA[一 简介
以类A为例。
1.1 拷贝构造函数
1.1.1 形式
A(const A&amp;)

1.1.2 作用
首先，它是一个构造函数，所以是用于对象的初始化。其次，它构造对象的规则是通过拷贝各个成员变量完成。
1.2 重载operator=
1.2.1 形式
A&amp; operator=(const A&amp;)

1.2.2 作用
对于一个对象的赋值（注意，不是初始化，初始化调用的是...]]></description><category></category></item><item><title><![CDATA[一句标准的Spark WordCount代码究竟产生了多少个RDD？]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/102066379</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/102066379</guid><author>smart_ferry</author><pubDate>Fri, 04 Oct 2019 13:54:45 +0800</pubDate><description><![CDATA[sc.textFile("./data/input")
  .flatMap(x -&gt; Arrays.asList(x.split(" ")).iterator())
  .mapToPair(x -&gt; new Tuple2&lt;&gt;(x, 1))
  .reduceByKey((x1, x2) -&gt; x1 + x2)
  .saveAsTextFile("./data/o...]]></description><category></category></item><item><title><![CDATA[SparkStreaming之socketTextStream遇到的一些小问题]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/90643877</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/90643877</guid><author>smart_ferry</author><pubDate>Tue, 28 May 2019 18:11:18 +0800</pubDate><description><![CDATA[实验环境

主机名
			IP
			操作系统
		host1
			192.168.110.1
			Windows
		host2
			192.168.110.13
			Linux
		实验准备

首先在host2上使用nc命令打开端口7777，之后在host1上运行代码

实验代码


import org.apache.spark._
import org.apache.spark.s...]]></description><category></category></item><item><title><![CDATA[Scala之wordCount]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/90177648</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/90177648</guid><author>smart_ferry</author><pubDate>Mon, 13 May 2019 17:58:56 +0800</pubDate><description><![CDATA[代码


import scala.collection.mutable.HashMap
import scala.io.Source
object Test {
  def main(args: Array[String]): Unit = {
    wordCount("dictName")
  }
  def wordCount(dictName: String): Unit ={
   ...]]></description><category></category></item><item><title><![CDATA[Scala之flatMap操作]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/90168473</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/90168473</guid><author>smart_ferry</author><pubDate>Mon, 13 May 2019 11:00:18 +0800</pubDate><description><![CDATA[个人理解

调用flatMap方法的是一个可迭代集合（注意：字符串是一个可迭代集合，字符串中的元素为字符）
	什么类型调用的flatMap方法，则返回的也是什么类型
	flatMap = map + flatten 即先对集合中的每个元素进行map，再对map后的每个元素（map后的每个元素必须还是集合）中的每个元素进行flatten
	进行map的对象可以是只含一层的集合，但进行flatten操...]]></description><category></category></item><item><title><![CDATA[leetcode----72. Edit Distance]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/90081502</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/90081502</guid><author>smart_ferry</author><pubDate>Fri, 10 May 2019 18:05:04 +0800</pubDate><description><![CDATA[链接：

https://leetcode.com/problems/edit-distance/

大意：

给定两个单词word1和word2，规定从word1转为word2的每个操作仅限于增加一次字符、删除一次字符或者修改一次字符。求word1转换为word2所需的最小转换次数。例子：



大意：

使用动态规划解决。详情见代码以及注释。

代码：


class Solution {
 ...]]></description><category></category></item><item><title><![CDATA[leetcode----229. Majority Element II]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/89710533</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/89710533</guid><author>smart_ferry</author><pubDate>Tue, 30 Apr 2019 15:42:55 +0800</pubDate><description><![CDATA[链接：

https://leetcode.com/problems/majority-element-ii/

大意：

给定一个整数数组nums，要求找出数组中出现次数超过nums.length / 3次的所有数字。规定：使用时间复杂度为O(n)，空间复杂度为O(1)的方法解决。例子：



思路：

全军覆没。思路参考链接：https://leetcode.com/problems/majo...]]></description><category></category></item><item><title><![CDATA[leetcode----228. Summary Ranges]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/89706032</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/89706032</guid><author>smart_ferry</author><pubDate>Tue, 30 Apr 2019 11:33:02 +0800</pubDate><description><![CDATA[链接：

https://leetcode.com/problems/summary-ranges/

大意：

给定一个整数数组nums，要求找出nums中所有满足连续排列的区间数字。例子：



思路：

一次遍历数组，只需要记录一个前一个数字的值以及当前是否在遍历连续的排列。

代码：


class Solution {
    public List&lt;String&gt; summ...]]></description><category></category></item><item><title><![CDATA[leetcode----227. Basic Calculator II]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/89705577</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/89705577</guid><author>smart_ferry</author><pubDate>Tue, 30 Apr 2019 11:18:05 +0800</pubDate><description><![CDATA[链接：

https://leetcode.com/problems/basic-calculator-ii/

大意：

实现一个计算器。给定一个字符串s，字符串s中的字符由'0'-'9'的数字以及'+'、'-'、'*'、'/'以及空格组成。要求求出字符串s所代表表达式的结果。例子：



思路：

构造两个栈，一个为操作数栈，里面存放操作数（整数）；一个为操作符栈，里面存放四种运算符（字符）。...]]></description><category></category></item><item><title><![CDATA[leetcode----223. Rectangle Area]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/89704649</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/89704649</guid><author>smart_ferry</author><pubDate>Tue, 30 Apr 2019 10:42:32 +0800</pubDate><description><![CDATA[链接：

https://leetcode.com/problems/rectangle-area/

大意：

分别给定两个矩形的左下角顶点坐标和右下角顶点坐标，格式为：

对于矩形1：左下角顶点为(A,B)，右上角顶点为(C,D)

对于矩形2：左下角顶点为(E,F)，右上角顶点为(G,H)

求两个矩形的所覆盖的总面积。

例子：



思路：

对两个矩形的关系分情况套路。

情况一：两个...]]></description><category></category></item><item><title><![CDATA[leetcode----222. Count Complete Tree Nodes]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/89702960</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/89702960</guid><author>smart_ferry</author><pubDate>Tue, 30 Apr 2019 09:33:56 +0800</pubDate><description><![CDATA[链接：

https://leetcode.com/problems/count-complete-tree-nodes/

大意：

给定一棵完全二叉树，求二叉树的节点数。例子：



思路：

任意一种遍历方法都可以解决。

代码：


class Solution {
    // 以任意一种遍历方法得到节点数
    private int count = 0;
    public in...]]></description><category></category></item><item><title><![CDATA[leetcode----220. Contains Duplicate III]]></title><link>https://blog.youkuaiyun.com/smart_ferry/article/details/89668441</link><guid>https://blog.youkuaiyun.com/smart_ferry/article/details/89668441</guid><author>smart_ferry</author><pubDate>Mon, 29 Apr 2019 11:13:34 +0800</pubDate><description><![CDATA[链接：

https://leetcode.com/problems/contains-duplicate-iii/

大意：

给定一个整数数组nums，一个整数k，一个整数n。要求判断数组nums中是否存在不同的两个索引下标i和j，使得 |i - j| &lt;= k 并且 |nums[i] - nums[j]| &lt;= t。例子：



思路：

暂时没想到好方法，只能暴力法先解决了。
...]]></description><category></category></item></channel></rss>