<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Alfheim]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/usercaesar</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; usercaesar]]></copyright><item><title><![CDATA[pyspark union按位置合并而不是按列的名字合并]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/109601649</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/109601649</guid><author>usercaesar</author><pubDate>Tue, 10 Nov 2020 16:29:38 +0800</pubDate><description><![CDATA[pyspark union 将A和B按照列的位置合并而不是列名合并，可能列名不对齐。
先select（）将列整理成相同顺序

]]></description><category></category></item><item><title><![CDATA[leetcode 1346. Check If N and Its Double Exist 排序，双指针扫描，注意正负；哈希表]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/108421731</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/108421731</guid><author>usercaesar</author><pubDate>Sat, 05 Sep 2020 16:54:25 +0800</pubDate><description><![CDATA[leetcode 1346. Check If N and Its Double Exist
如果都是非负数的从小到大有序序列，从左往右i,j两个指针扫描，j为不满足2*a[i]&lt;a[j]的下一个j。
排序O（nlogn)，扫描O（n）
如果有正有负，分成两个序列，把负数序列反转、取相反数。
class Solution 
{
public:
	bool check_sorted(vector&lt;int&gt;&amp; arr)
	{
//		sort(arr.begin(),arr.end()]]></description><category></category></item><item><title><![CDATA[leetcode 313. Super Ugly Number]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/108332235</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/108332235</guid><author>usercaesar</author><pubDate>Tue, 01 Sep 2020 00:15:12 +0800</pubDate><description><![CDATA[313. Super Ugly Number
遍历
从小到大找ugly number，每个新的ugly number是primes中的素数乘积，必然是某个素数乘之前的某个ugly number。每个primes中的素数记录一个下标，对应将要乘的ugly number。每个primes中的素数，乘以之前的尽量小的ugly number，但如果之前某个ugly number能和该素数生成之前某个ugly number，则给该素数记录的接下来将要乘的ugly number下标+1。
注意INT_MAX和long ]]></description><category></category></item><item><title><![CDATA[leetcode 714. Best Time to Buy and Sell Stock with Transaction Fee 遍历、递推、状态转移]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/108300251</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/108300251</guid><author>usercaesar</author><pubDate>Sat, 29 Aug 2020 22:13:38 +0800</pubDate><description><![CDATA[leetcode 714. Best Time to Buy and Sell Stock with Transaction Fee
（未完待续）
一开始的想法：遍历，低买高卖，考虑手续费，所以价差不超过手续费不卖，先跌后涨但跌幅不超过手续费不卖，示例正确但Wrong Answer。
class Solution {
public:
    int maxProfit(vector&lt;int&gt;&amp; prices, int fee) 
    {
        int len=prices.]]></description><category></category></item><item><title><![CDATA[leetcode 1171. Remove Zero Sum Consecutive Nodes from Linked List 前缀和]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/108271161</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/108271161</guid><author>usercaesar</author><pubDate>Fri, 28 Aug 2020 00:11:20 +0800</pubDate><description><![CDATA[leetcode 1171. Remove Zero Sum Consecutive Nodes from Linked List
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullp]]></description><category></category></item><item><title><![CDATA[leetcode 189. Rotate Array]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/108249125</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/108249125</guid><author>usercaesar</author><pubDate>Wed, 26 Aug 2020 22:37:29 +0800</pubDate><description><![CDATA[leetcode 189. Rotate Array
调库：
class Solution 
{
public:
    void rotate(vector&lt;int&gt;&amp; nums, int k) 
    {
        int len=nums.size();
        k=k%len;
        vector&lt;int&gt; vec_a(nums.end()-k,nums.end());
        vector&lt;int&gt; vec_b(nums]]></description><category></category></item><item><title><![CDATA[洛谷 P1309 瑞士轮 归并]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/108246323</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/108246323</guid><author>usercaesar</author><pubDate>Wed, 26 Aug 2020 19:47:39 +0800</pubDate><description><![CDATA[洛谷 P1309 瑞士轮
https://www.luogu.com.cn/problem/P1309
每一轮快排，超时：
# include&lt;iostream&gt;
# include&lt;fstream&gt;
# include&lt;vector&gt; 
# include&lt;algorithm&gt; 
using namespace std;
class Athlete
{
public:
	int id,competence,score;
	Athlete(){}
	// 
	]]></description><category></category></item><item><title><![CDATA[UnboundLocalError: local variable ‘logs‘ referenced before assignment]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/108203505</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/108203505</guid><author>usercaesar</author><pubDate>Mon, 24 Aug 2020 17:20:42 +0800</pubDate><description><![CDATA[UnboundLocalError: local variable ‘logs’ referenced before assignment
tensorflow model.fit(feature,label)
UnboundLocalError: local variable ‘logs’ referenced before assignment
训练集数据过小，增加数据即可
详见https://github.com/tensorflow/tensorflow/issues/38064

...]]></description><category></category></item><item><title><![CDATA[MySQL向表中导入csv文件]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/108125462</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/108125462</guid><author>usercaesar</author><pubDate>Thu, 20 Aug 2020 15:52:47 +0800</pubDate><description><![CDATA[mySQL向表中导入csv文件
LOAD DATA LOCAL INFILE “data.csv”
INTO TABLE my_table
FIELDS TERMINATED BY ‘,’
ENCLOSED BY ‘"’
LINES TERMINATED BY ‘\r\n’
IGNORE 1 LINES;
（此处忽略1行及表头）

]]></description><category></category></item><item><title><![CDATA[MySQL查看表的每个字段信息]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/108125437</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/108125437</guid><author>usercaesar</author><pubDate>Thu, 20 Aug 2020 15:50:16 +0800</pubDate><description><![CDATA[mySQL查看表的每个字段信息
show full columns from my_table

]]></description><category></category></item><item><title><![CDATA[conda设置proxy_server]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/107543256</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/107543256</guid><author>usercaesar</author><pubDate>Thu, 23 Jul 2020 17:38:13 +0800</pubDate><description><![CDATA[conda config --set proxy_servers.http http://id:pw@address:port
conda config --set proxy_servers.https https://id:pw@address:port


]]></description><category></category></item><item><title><![CDATA[matplotlib在linux服务器画图]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/107538812</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/107538812</guid><author>usercaesar</author><pubDate>Thu, 23 Jul 2020 15:41:52 +0800</pubDate><description><![CDATA[matplotlib在linux服务器画图
import matplotlib
matplotlib.use('Agg')
import matplotlib.pyplot as plt

注意语句顺序，use(‘Agg’)在plt之前

]]></description><category></category></item><item><title><![CDATA[tensorflow LSTM stateless改为stateful]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/107533178</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/107533178</guid><author>usercaesar</author><pubDate>Thu, 23 Jul 2020 11:45:47 +0800</pubDate><description><![CDATA[tensorflow LSTM stateless改为stateful
训练模型时用stateless，预测时用stateful保持记忆。预测时新建模型，复制训练模型的参数。
for nb, layer in enumerate(model.layers):
    model2.layers[nb].set_weights(layer.get_weights())


...]]></description><category></category></item><item><title><![CDATA[pandas画双柱形图]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/106161598</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/106161598</guid><author>usercaesar</author><pubDate>Sat, 16 May 2020 17:04:42 +0800</pubDate><description><![CDATA[pandas画双柱形图
matplotlib画双柱形图需要指定两个柱形图subplot的位置使得恰好拼成一个双柱形图。
用pandas画双柱形图更简便。
import numpy as np
import pandas as pd
import matplotlib.pyplot as plt

name_list=["A","B","C"]
pair_list=[[1,1],[2,3],[4,5]]
pair_list=np.array(pair_list)
img_df=pd.DataFrame(pai]]></description><category></category></item><item><title><![CDATA[Latex beamer ppt 中文]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/105968657</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/105968657</guid><author>usercaesar</author><pubDate>Thu, 07 May 2020 11:20:49 +0800</pubDate><description><![CDATA[Latex beamer ppt 中文
\documentclass{beamer}
\usepackage[UTF8]{ctex}
\usepackage{ulem}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{geometry}
\usepackage{graphicx}
\usepackage{subfigure}
\usepa...]]></description><category></category></item><item><title><![CDATA[Vim简单操作 命令模式 输入模式 保存 翻页 光标移动]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/105761145</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/105761145</guid><author>usercaesar</author><pubDate>Sun, 26 Apr 2020 07:46:17 +0800</pubDate><description><![CDATA[Vim简单操作 命令模式 输入模式 保存 翻页 光标移动
命令模式按i进入输入模式
输入模式按esc进入命令模式
命令模式
h 或 向左箭头键(←)	光标向左移动一个字符
j 或 向下箭头键(↓)	光标向下移动一个字符
k 或 向上箭头键(↑)	光标向上移动一个字符
l 或 向右箭头键(→)	光标向右移动一个字符
组合键：10j即向下移动10个字符
[Ctrl] + [f]		屏幕向下移动一页
[...]]></description><category></category></item><item><title><![CDATA[洛谷 P1896 [SCOI2005]互不侵犯 递推/动归 （可状态压缩)]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/105608273</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/105608273</guid><author>usercaesar</author><pubDate>Sun, 19 Apr 2020 00:06:03 +0800</pubDate><description><![CDATA[洛谷 P1896 [SCOI2005]互不侵犯
题目描述
在N×N的棋盘里面放K个国王，使他们互不攻击，共有多少种摆放方案。国王能攻击到它上下左右，以及左上左下右上右下八个方向上附近的各一个格子，共8个格子。
输入格式
只有一行，包含两个数N，K （ 1 &lt;=N &lt;=9, 0 &lt;= K &lt;= N * N）
输出格式
所得的方案数
递推/动态规划
只考虑一行，一行合法状态必须...]]></description><category></category></item><item><title><![CDATA[leetcode 1371. Find the Longest Substring Containing Vowels in Even Counts]]></title><link>https://blog.youkuaiyun.com/usercaesar/article/details/105560151</link><guid>https://blog.youkuaiyun.com/usercaesar/article/details/105560151</guid><author>usercaesar</author><pubDate>Thu, 16 Apr 2020 16:20:54 +0800</pubDate><description><![CDATA[Find the Longest Substring Containing Vowels in Even Counts
用state表示[0,i]子字符串的状态，状态有5个二进制位，对应5个元音字母的奇偶性

class Solution 
{
public:
    int findTheLongestSubstring(string s) 
    {
        int str_len...]]></description><category></category></item></channel></rss>