<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[SummerHmh的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/SummerHmh</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; SummerHmh]]></copyright><item><title><![CDATA[pyspark之DataFrame写hive表方式]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/103820628</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/103820628</guid><author>SummerHmh</author><pubDate>Fri, 03 Jan 2020 15:30:59 +0800</pubDate><description><![CDATA[文章目录spark 语句静态分区动态分区spark SQL 处理方法例子
最近用spark写hive的过程中，遇到了一些问题，故此把这一块整理整理，供使用参考
spark 语句
hive中静态分区和动态分区的区别在于，静态分区是指定分区值，动态区分是根据值进行自动添加到对应的分区。后者在效率上会比较低，需要启动与分区数相同的数量的reducer
静态分区
df.write.mode('overwr...]]></description><category></category></item><item><title><![CDATA[Linux安装fbprophet]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/100080338</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/100080338</guid><author>SummerHmh</author><pubDate>Mon, 26 Aug 2019 16:22:53 +0800</pubDate><description><![CDATA[直接执行pip3 install fbprophet 

在升级matplotlib的时候会报错，错误信息如下

在升级matplotlib的时候有问题
正确姿势

先升级\安装matplotlib，而且不能用pip3 install matplotlib ，参考网上无数的解决方案，都无效，正确的安装指令如下python -mpip install matplotlib


安装fbprophe...]]></description><category></category></item><item><title><![CDATA[jupyter插件和主题]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/99643669</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/99643669</guid><author>SummerHmh</author><pubDate>Thu, 15 Aug 2019 16:59:55 +0800</pubDate><description><![CDATA[插件配置

关闭正在运行的jupyter
安装插件包pip install jupyter_contrib_nbextensions


配置nbextensionjupyter contrib nbextension install --user --skip-running-check


启动jupyter

风格设置

安装jupyterthemespip install --upgrad...]]></description><category></category></item><item><title><![CDATA[Jupyter常驻之密码登录]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/99555690</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/99555690</guid><author>SummerHmh</author><pubDate>Wed, 14 Aug 2019 15:03:41 +0800</pubDate><description><![CDATA[安装jupyter
pip3 install jupyter notebook



生成配置文件
jupyter-notebook --generate-config



生成密钥
jupyter notebook password

输入要设置的密码


启动服务
 nohup jupyter notebook --allow-root &gt; jupyter.log 2&gt;&am...]]></description><category></category></item><item><title><![CDATA[月结——Transformer之上的一些故事]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/94293643</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/94293643</guid><author>SummerHmh</author><pubDate>Sun, 30 Jun 2019 20:17:46 +0800</pubDate><description><![CDATA[文章目录Transformer模型解释BertERNIEStyle Transformer
Transformer
传统seq2seq的问题一般用CNN或者RNN的方式来处理，将seq编码为一个固定长度的向量然后再进行解码。因为固定长度向量所能表征的信息有限，因此对于长序列来说，前面的信息容易被埋没，即具有长程依赖问题，同时这种方式是顺序执行，使得没有办法进行并行计算。于是，google的大神们，...]]></description><category></category></item><item><title><![CDATA[概率图系列之隐马尔可夫模型（HMM）]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/93165974</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/93165974</guid><author>SummerHmh</author><pubDate>Fri, 21 Jun 2019 21:46:42 +0800</pubDate><description><![CDATA[概率图模型
概率图模型是一类用图来表达变量相关关系的概率模型。常见的是用一个节点表示一个或一组随机变量，节点之间的边表示变量之间的概率相关关系，如下图：

概率图根据边的性质，可以划分为两种：

有向图无环图——有向图模型或贝叶斯网
无向图——无向图图或马尔可夫网

隐马尔可夫模型（HMM）
性质：结构最简单的动态贝叶斯网——有向无环图
描述：由一个隐藏的马尔可夫链生成不可观测的状态随机序列，再由...]]></description><category></category></item><item><title><![CDATA[《Style Transformer: Unpaired Text Style Transfer without Disentangled Latent Representation》浅析]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92804375</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92804375</guid><author>SummerHmh</author><pubDate>Wed, 19 Jun 2019 14:01:19 +0800</pubDate><description><![CDATA[文章目录摘要发展模型问题描述步骤模型训练机制代码解析效果
摘要
传统的文本样式转换通常是通过分解隐空间中的内容和风格的方式。这种方式存在如下两种问题：

很难从句子的语义中完全剥离样式信息
基于编解码器模式的RNN难以保持长程依赖，导致内容保真度有损

本文提出一种不用隐空间假设，基于注意力机制的模型——Style Transformer，能够较好的保持文本内容，同时很好的转化文本风格
发展
文本...]]></description><category></category></item><item><title><![CDATA[557. Reverse Words in a String III]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92580137</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92580137</guid><author>SummerHmh</author><pubDate>Mon, 17 Jun 2019 10:48:38 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/reverse-words-in-a-string-iii/
代码
class Solution:
    def reverseWords(self, s: str) -&gt; str:
        n=len(s)
        start=0
        res=''
        i=0
        w...]]></description><category></category></item><item><title><![CDATA[344. Reverse String]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92579653</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92579653</guid><author>SummerHmh</author><pubDate>Mon, 17 Jun 2019 10:45:52 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/reverse-string/
代码
class Solution:
    def reverseString(self, s: List[str]) -&gt; None:
        """
        Do not return anything, modify s in-place instead.
     ...]]></description><category></category></item><item><title><![CDATA[292. Nim Game]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92574506</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92574506</guid><author>SummerHmh</author><pubDate>Mon, 17 Jun 2019 10:19:11 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/nim-game/
代码
class Solution:
    def canWinNim(self, n: int) -&gt; bool:
        return n%4!=0


]]></description><category></category></item><item><title><![CDATA[238. Product of Array Except Self]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92570988</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92570988</guid><author>SummerHmh</author><pubDate>Mon, 17 Jun 2019 10:02:24 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/product-of-array-except-self/
代码
class Solution:
    def productExceptSelf(self, nums: List[int]) -&gt; List[int]:
        n=len(nums)
        dp1,dp2=[1]*n,[1]*n
  ...]]></description><category></category></item><item><title><![CDATA[237. Delete Node in a Linked List]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92564495</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92564495</guid><author>SummerHmh</author><pubDate>Mon, 17 Jun 2019 09:30:51 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/delete-node-in-a-linked-list/
代码
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = Non...]]></description><category></category></item><item><title><![CDATA[236. Lowest Common Ancestor of a Binary Tree]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92563464</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92563464</guid><author>SummerHmh</author><pubDate>Mon, 17 Jun 2019 09:23:50 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
代码
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self...]]></description><category></category></item><item><title><![CDATA[235. Lowest Common Ancestor of a Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92442277</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92442277</guid><author>SummerHmh</author><pubDate>Mon, 17 Jun 2019 09:21:15 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
代码
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#      ...]]></description><category></category></item><item><title><![CDATA[231. Power of Two]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92439738</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92439738</guid><author>SummerHmh</author><pubDate>Sun, 16 Jun 2019 23:14:28 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/power-of-two/
代码
class Solution:
    def isPowerOfTwo(self, n: int) -&gt; bool:
        if n==0:return False
        return not n&amp;(n-1)

解题思路
2n2^n2n在二进制上只有一位是1，...]]></description><category></category></item><item><title><![CDATA[230. Kth Smallest Element in a BST]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92438349</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92438349</guid><author>SummerHmh</author><pubDate>Sun, 16 Jun 2019 22:57:34 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/kth-smallest-element-in-a-bst/
代码
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = No...]]></description><category></category></item><item><title><![CDATA[217. Contains Duplicate]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92252963</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92252963</guid><author>SummerHmh</author><pubDate>Sun, 16 Jun 2019 00:54:13 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/contains-duplicate/submissions/
代码
class Solution:
    def containsDuplicate(self, nums: List[int]) -&gt; bool:
        if not nums:return False
        frequen=set(...]]></description><category></category></item><item><title><![CDATA[215. Kth Largest Element in an Array]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92252296</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92252296</guid><author>SummerHmh</author><pubDate>Sun, 16 Jun 2019 00:47:23 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/kth-largest-element-in-an-array/submissions/
代码
class Solution:
    def findKthLargest(self, nums: List[int], k: int) -&gt; int:
        """
        :type nums: List...]]></description><category></category></item><item><title><![CDATA[206. Reverse Linked List]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92219182</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92219182</guid><author>SummerHmh</author><pubDate>Sat, 15 Jun 2019 22:31:40 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/reverse-linked-list/
代码
# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None...]]></description><category></category></item><item><title><![CDATA[169. Majority Element]]></title><link>https://blog.youkuaiyun.com/SummerHmh/article/details/92215953</link><guid>https://blog.youkuaiyun.com/SummerHmh/article/details/92215953</guid><author>SummerHmh</author><pubDate>Sat, 15 Jun 2019 22:21:42 +0800</pubDate><description><![CDATA[题目链接：https://leetcode.com/problems/majority-element/
代码
class Solution(object):
    def majorityElement(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        f...]]></description><category></category></item></channel></rss>