<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Jesus in my place]]></title><description><![CDATA[与主同行]]></description><link>https://blog.youkuaiyun.com/jellyYin</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jellyYin]]></copyright><item><title><![CDATA[GNUPLOT linespoints and save as pdf]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/51990957</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/51990957</guid><author>jellyYin</author><pubDate>Fri, 22 Jul 2016 02:55:36 +0800</pubDate><description><![CDATA[set terminal postscript eps enhanced color font ',30'
set yrange [0:1]
set logscale x
set xrange [200:100000]
set grid
set xlabel "flow duration (us)"
set key bottom
set output "| ps2pdf -dEPSCrop - w]]></description><category></category></item><item><title><![CDATA[[LeetCode] Distinct Subsequences]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/47314413</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/47314413</guid><author>jellyYin</author><pubDate>Thu, 06 Aug 2015 11:52:46 +0800</pubDate><description><![CDATA[Given a string S and a string T, count the number of distinct subsequences of T in S.

A subsequence of a string is a new string which is formed from the original string by deleting some (can be non]]></description><category></category></item><item><title><![CDATA[[python] Lift is short, I need python!]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/26108849</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/26108849</guid><author>jellyYin</author><pubDate>Sun, 26 Jul 2015 00:27:02 +0800</pubDate><description><![CDATA[class Solution:
    # @param s, a string
    # @return a string
    def reverseWords(self, s):
        if len(s)==0 :
            return s
        #reverse the whole string first
        s=s[::-1]]]></description><category></category></item><item><title><![CDATA[[LeetCode] HouseRobber]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/46787129</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/46787129</guid><author>jellyYin</author><pubDate>Tue, 07 Jul 2015 11:29:03 +0800</pubDate><description><![CDATA[You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house]]></description><category></category></item><item><title><![CDATA[[LeetCode]Implement Trie (Prefix Tree)]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/46517425</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/46517425</guid><author>jellyYin</author><pubDate>Tue, 16 Jun 2015 13:58:04 +0800</pubDate><description><![CDATA[class TrieNode {
public:
    // Initialize your data structure here.
    TrieNode() {
            val='0';
            end_of_a_word=0;
            for(int i=0;i<26;i++)
            {
                ]]></description><category></category></item><item><title><![CDATA[[LeetCode] Contains Duplicate]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/46456671</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/46456671</guid><author>jellyYin</author><pubDate>Thu, 11 Jun 2015 13:48:11 +0800</pubDate><description><![CDATA[Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least
 twice in the array, and it should return false if every element ]]></description><category></category></item><item><title><![CDATA[递归删除文件]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/41695837</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/41695837</guid><author>jellyYin</author><pubDate>Wed, 03 Dec 2014 13:18:34 +0800</pubDate><description><![CDATA[find . -name 'log_snd' -delete]]></description><category></category></item><item><title><![CDATA[TOP用法]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/40769945</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/40769945</guid><author>jellyYin</author><pubDate>Tue, 04 Nov 2014 02:34:20 +0800</pubDate><description><![CDATA[1. 
top -p 8530 -b -n10 -d 1 >> nolog.txt]]></description><category></category></item><item><title><![CDATA[embed all fonts in pdf for camera ready version]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/38841017</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/38841017</guid><author>jellyYin</author><pubDate>Tue, 26 Aug 2014 05:01:40 +0800</pubDate><description><![CDATA[gs -q -dNOPAUSE -dBATCH -dPDFSETTINGS=/prepress -sDEVICE=pdfwrite -sOutputFile=output.pdf  input.pdf]]></description><category></category></item><item><title><![CDATA[Matlab 命令行设置颜色和legend，保存图像，设置title。。。]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/38509437</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/38509437</guid><author>jellyYin</author><pubDate>Tue, 12 Aug 2014 06:18:42 +0800</pubDate><description><![CDATA[i=10;
goodput=(i-1)*5+2;
rtt=goodput+1;
lossrate=rtt+1;
qpm=lossrate+1;
total_request=qpm+1;
figure
h6=plot(asn12322_smoothed(:,goodput)*100/max(asn12322_smoothed(:,goodput)),'-r');
hold on;
h7=plot(a]]></description><category></category></item><item><title><![CDATA[将文件夹下所有pdf变成黑白的脚本]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/38468735</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/38468735</guid><author>jellyYin</author><pubDate>Sun, 10 Aug 2014 11:51:14 +0800</pubDate><description><![CDATA[#!/bin/bash
for file in ./*.pdf
do
  echo "$file"
  gs -o black+white.pdf -sDEVICE=pdfwrite -dPDFSETTINGS=/prepress -sColorConversionStrategy=Gray -sColorConversionStrategyForImages=Gray -sProcessColo]]></description><category></category></item><item><title><![CDATA[[Latex] 如何将latex的伪代码algorithm保存为大小fit的pdf或者图像]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/38464691</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/38464691</guid><author>jellyYin</author><pubDate>Sun, 10 Aug 2014 01:21:12 +0800</pubDate><description><![CDATA[\documentclass{article}
\usepackage[margin=0in,paperheight=8in, paperwidth=4.3in]{geometry}
\usepackage{amsmath}
\usepackage{algorithm}
\usepackage[noend]{algpseudocode}
\usepackage{setspace}
\usepack]]></description><category></category></item><item><title><![CDATA[Matlab 绘制 clustered rowstacked bar plot]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/38455487</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/38455487</guid><author>jellyYin</author><pubDate>Sat, 09 Aug 2014 12:40:44 +0800</pubDate><description><![CDATA[set terminal postscript font "Helvetica, 16"  
set boxwidth 0.9 absolute  
set style fill pattern 2 border lt -1]]></description><category></category></item><item><title><![CDATA[GNUPLOT bar plot 绘制，并用条纹填充]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/38437367</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/38437367</guid><author>jellyYin</author><pubDate>Fri, 08 Aug 2014 12:00:22 +0800</pubDate><description><![CDATA[set terminal postscript font "Helvetica, 16"
set boxwidth 0.9 absolute
set style fill pattern 2 border lt -1
set style histogram clustered gap 1 title  offset character 0, 0, 0
set datafile missing '-]]></description><category></category></item><item><title><![CDATA[Matlab绘图marker间距调整脚本]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/38356367</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/38356367</guid><author>jellyYin</author><pubDate>Sun, 03 Aug 2014 10:56:48 +0800</pubDate><description><![CDATA[h1=plot(cubicdelay5thttp0500ms(1:180,3),cubicdelay5thttp0500ms(1:180,2)/1000,'--');
hold on
h2=plot(cubicdelay5thttp0500ms(1:180,3),theorapiddelay5thttp0500ms(1:180,2)/1000);
h4=plot(cubicdelay5thttp0]]></description><category></category></item><item><title><![CDATA[Matlab 绘图，文件名为变量肿么办]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/38309959</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/38309959</guid><author>jellyYin</author><pubDate>Thu, 31 Jul 2014 01:28:44 +0800</pubDate><description><![CDATA[for i=1:100
    filename=strcat('RTT/path',num2str(asn12322_counter(i,1)-1),'_loss_smooth_30.dat');
    tmpfile=load(filename);
    h1=plot((tmpfile(:,1)-asn12322(1,1))/60, tmpfile(:,3));
    lege]]></description><category></category></item><item><title><![CDATA[[matlab]matlab批量导入纯数字文件]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/18062677</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/18062677</guid><author>jellyYin</author><pubDate>Fri, 10 Jan 2014 02:01:35 +0800</pubDate><description><![CDATA[将所有文件放入当前文件夹下data文件夹中
list=dir('./data');
list.name
N=length(list)
for i=3:N eval(['load ' 'data\' list(i,1).name]); end]]></description><category></category></item><item><title><![CDATA[[LeetCode] Remove Duplicate from Sorted Linkded List II]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/13621589</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/13621589</guid><author>jellyYin</author><pubDate>Wed, 30 Oct 2013 09:31:31 +0800</pubDate><description><![CDATA[Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example,
Given 1->2->3->3->4->4->5, return 1->2->5.
Given 1->1-]]></description><category></category></item><item><title><![CDATA[[LeetCode] Merge K sorted lists]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/13168693</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/13168693</guid><author>jellyYin</author><pubDate>Sun, 27 Oct 2013 12:09:01 +0800</pubDate><description><![CDATA[Solution 1:
1. use merge2list(), and merge all lists one by one. Time complexity is O(n*longest list length)
2. For each node, find the smallest node among all head nodes in O(k) time, Time complexi]]></description><category></category></item><item><title><![CDATA[[LeetCode] 2Sum, 3Sum, 4Sum, 3SUm closet]]></title><link>https://blog.youkuaiyun.com/jellyYin/article/details/13166557</link><guid>https://blog.youkuaiyun.com/jellyYin/article/details/13166557</guid><author>jellyYin</author><pubDate>Sun, 27 Oct 2013 09:31:52 +0800</pubDate><description><![CDATA[1. 2Sum: hash Table O(n*n)
2. 3Sum: 2Sum + 1 : O(n*n)
for loop + 左右夹逼法：O（N＊N）
class Solution {
public:

    vector > threeSum(vector &num) {
        // Note: The Solution object is instantiated]]></description><category></category></item></channel></rss>