<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[bingo_boy的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/bingo_boy</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bingo_boy]]></copyright><item><title><![CDATA[最大子序列和]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/50918229</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/50918229</guid><author>bingo_boy</author><pubDate>Thu, 17 Mar 2016 23:27:27 +0800</pubDate><description><![CDATA[问题
  Given a sequence a[1],a[2],a[3]……a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14. 
问题传送门 密码：me]]></description><category></category></item><item><title><![CDATA[lz77算法 例子]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/50420257</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/50420257</guid><author>bingo_boy</author><pubDate>Mon, 28 Dec 2015 17:21:56 +0800</pubDate><description><![CDATA[摘自 https://en.wikipedia.org/wiki/LZ77_and_LZ78

Example[edit]

The calculation of the LZ77-based factorization of the string aacaacabcabaaac illustrated.

The table shows the calculation of the ]]></description><category></category></item><item><title><![CDATA[c c++ 结构体对齐]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/50236327</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/50236327</guid><author>bingo_boy</author><pubDate>Wed, 09 Dec 2015 15:00:59 +0800</pubDate><description><![CDATA[偏移位置计算方法：
结构体变量的首地址能够被其最宽基本类型成员的大小所整除
结构体的总大小为结构体最宽基本类型成员大小和编译器缺省対界条件大小中比较小得那个值的整数倍，如有需要编译器会在最后一个成员之后加上填充字节
结构体每个成员相对于结构体首地址的偏移量（offset）都是成员大小的整数倍，如有需要编译器会在成员之间加上填充字符
#pragma pack 的值跟sizeof(int)等取最小者进行]]></description><category></category></item><item><title><![CDATA[网页关键字碰到的问题]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/49181457</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/49181457</guid><author>bingo_boy</author><pubDate>Fri, 16 Oct 2015 17:34:51 +0800</pubDate><description><![CDATA[生成了一个大的日志文件3.3G。文件结构如下：url:...
src_ip&src_port:...
dst_ip&dst_port:...
gzip_deflate_hex_coding:...
gzip_deflate_length:...
要提取coding跟length字段进行分析： 将所有的coding字段重复的length加和，然后除以总的length，日志太大，不能用简单的cpp实现(]]></description><category></category></item><item><title><![CDATA[算法 学习]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/48501923</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/48501923</guid><author>bingo_boy</author><pubDate>Wed, 16 Sep 2015 21:24:07 +0800</pubDate><description><![CDATA[1、并查集 & 字典树 & 欧拉路径 
* 并查集：路径压缩 
*  字典树：用来把unique string转化为int 
*  欧拉路径(顺带哈密顿路径)判断
  poj2513解题报告]]></description><category></category></item><item><title><![CDATA[c++ primer学习笔记]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/48211877</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/48211877</guid><author>bingo_boy</author><pubDate>Fri, 04 Sep 2015 19:15:26 +0800</pubDate><description><![CDATA[非const的static成员变量，在类中声明，在cpp文件中定义]]></description><category></category></item><item><title><![CDATA[makefile demo]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/48195473</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/48195473</guid><author>bingo_boy</author><pubDate>Thu, 03 Sep 2015 16:13:39 +0800</pubDate><description><![CDATA[CC  = gcc
CFLAGS  += -g -Wall
CFLAGS  += $(OPTFLAGS)
OBJECTS := test_extern.o main.o 
TARGET  := testINCS    = -I./inc
LIB = LIBPATH += ./lib
BINPATH := ./bin/
vpath %.c src
vpath %.h inc%.o:%.c
    $(]]></description><category></category></item><item><title><![CDATA[gcc常用命令 以及 makefile vpath与-I选项]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/48181265</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/48181265</guid><author>bingo_boy</author><pubDate>Wed, 02 Sep 2015 17:39:56 +0800</pubDate><description><![CDATA[添加头文件 -I例如在/home/work/include/目录下有编译foo.c所需头文件def.h，为了让GCC能找到它们，就需要使用-I选项：
$ gcc foo.c -I /home/work/include/def.h -o foo
添加库文件：-L例如在/home/work/lib/目录下有链接所需库文件libdef.so，为了让GCC能找到它们，就需要使用-L选项：
$ gcc foo]]></description><category></category></item><item><title><![CDATA[gdb常用命令]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/48102985</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/48102985</guid><author>bingo_boy</author><pubDate>Sun, 30 Aug 2015 11:09:47 +0800</pubDate><description><![CDATA[调用gdb编译需要在cc后面加 -g参数再加-o；[root@redhat home]#gdb 调试文件：启动gdb
(gdb) l ：（字母l）从第一行开始列出源码
原文链接
(gdb) break n :在第n行处设置断点
(gdb) break func：在函数func()的入口处设置断点
(gdb) info break： 查看断点信息
(gdb) r：运行程序
(gdb) n：单步执行
(]]></description><category></category></item><item><title><![CDATA[C 语言开发]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/47841427</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/47841427</guid><author>bingo_boy</author><pubDate>Fri, 21 Aug 2015 20:46:11 +0800</pubDate><description><![CDATA[__FILE__ __LINE__
#ifndef ... #define ... #endif
多用结构体，有时候方便
注释格式–固定的
time_t 这里的’t’ 指的是type]]></description><category></category></item><item><title><![CDATA[c语言复习]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/47450915</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/47450915</guid><author>bingo_boy</author><pubDate>Wed, 12 Aug 2015 20:47:16 +0800</pubDate><description><![CDATA[const 和 指针
如果const位于*的左侧，则const就是用来修饰指针所指向的变量，即指针指向为常量；
如果const位于*的右侧，const就是修饰指针本身，即指针本身是常量。const int* p（推荐）int const* p
  第一种可以理解为，p是一个指针，它指向的内容是const int类型。p本身不用初始化它可以指向任何标示符，但它指向的内容是不能被改变的。
  
  第二]]></description><category></category></item><item><title><![CDATA[AppleScript开机自动登录ChinaUnicom]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/46718405</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/46718405</guid><author>bingo_boy</author><pubDate>Thu, 02 Jul 2015 00:56:38 +0800</pubDate><description><![CDATA[用Automator里的AppleScript编写的应用程序，其中主要是一行代码，主要作用是，用root权限执行一个脚本，脚本可以自动检测断网并进行重新连接！do shell script "sudo python xxx/xxx/xxx.py" user name "xxxxxx" password "xxxxxx" with administrator privileges]]></description><category></category></item><item><title><![CDATA[Longest Common Prefix --leetcode]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/46637541</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/46637541</guid><author>bingo_boy</author><pubDate>Thu, 25 Jun 2015 15:59:26 +0800</pubDate><description><![CDATA[思路一
思路：先查找最短的字符串，赋值给ret，然后从第一个字符串开始两两比较，比较ret与字符串数组里的公共字串。返回最后结果。
代码：
class Solution:
    # @param {string[]} strs
    # @return {string}
    def longestCommonPrefix(self, strs):
        if len(strs) =]]></description><category></category></item><item><title><![CDATA[Regular Expression Matching--leetcode]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/46618227</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/46618227</guid><author>bingo_boy</author><pubDate>Wed, 24 Jun 2015 09:41:20 +0800</pubDate><description><![CDATA[解法一
思路： 
写的第一个版本，知道是动态规划，但是不够简洁，因为动态方程 根本就没有写明白！！！！有点暴力的意思，其中还用到了剪枝操作
代码：
class Solution:
    # @param {string} s
    # @param {string} p
    # @return {boolean}
    def __init__(self):
        self.is]]></description><category></category></item><item><title><![CDATA[Longest Palindromic Substring--leetcode]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/46605501</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/46605501</guid><author>bingo_boy</author><pubDate>Tue, 23 Jun 2015 14:28:37 +0800</pubDate><description><![CDATA[我的解法v1：
思路：查找字符串中aa或者aba类似的字符字串，然后开始往两边拓展
代码：
class Solution:
    # @param {string} s
    # @return {string}
    def longestPalindrome(self, s):
        ret = ''
        if len(s) == 1:
            ret]]></description><category></category></item><item><title><![CDATA[String to Integer (atoi) -- leetcode]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/46604627</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/46604627</guid><author>bingo_boy</author><pubDate>Tue, 23 Jun 2015 12:58:26 +0800</pubDate><description><![CDATA[天了噜，条件真多
大体题意：   string to integer。。。]]></description><category></category></item><item><title><![CDATA[4th Median of Two Sorted Arrays -- leetcode]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/46592947</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/46592947</guid><author>bingo_boy</author><pubDate>Mon, 22 Jun 2015 13:35:43 +0800</pubDate><description><![CDATA[我的解法
思路：比较列表nums1中间和nums2中间的数，如果第一个列表小于第二个列表，那么不可能包含中间数的一串子序列总共有两串，nums1中间数前面的一串和nums2中间数后面的一串，比较长短，删除比较短的那一串(每次删掉其中一串序列的一半)，不断递归，直到其中的一个列表长度缩短为2，然后插入排序(log级别)，最后输出结果。
代码如下：
class Solution:
    # @para]]></description><category></category></item><item><title><![CDATA[关闭Dashboard]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/46581783</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/46581783</guid><author>bingo_boy</author><pubDate>Sun, 21 Jun 2015 14:08:48 +0800</pubDate><description><![CDATA[打开终端，输入下面的命令： 
defaults write com.apple.dashboard mcx-disabled -boolean YES
然后再重启一下 Dock，在终端输入: 
killall Dock
如果以后后悔了，想重新启用 Dashboard，就用下面的命令： 
defaults write com.apple.dashboard mcx-disabled -boolean]]></description><category></category></item><item><title><![CDATA[solution about leetcode problem 2 add Two Numbers]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/45694735</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/45694735</guid><author>bingo_boy</author><pubDate>Wed, 13 May 2015 16:23:12 +0800</pubDate><description><![CDATA[solution about leetcode problem 2 addTwoNumbers算法1： 
代码如下class Solution:
    # @param {ListNode} l1
    # @param {ListNode} l2
    # @return {ListNode}
    def addTwoNumbers(self, l1, l2):
        carr]]></description><category></category></item><item><title><![CDATA[查杀进程]]></title><link>https://blog.youkuaiyun.com/bingo_boy/article/details/45694201</link><guid>https://blog.youkuaiyun.com/bingo_boy/article/details/45694201</guid><author>bingo_boy</author><pubDate>Wed, 13 May 2015 15:54:22 +0800</pubDate><description><![CDATA[ps查杀进程命令介绍
常用命令 
ps -ef|grep wunder 
表示查看所有进程里wunder 的进程信息 
ps -aux | grep java 
-aux 显示所有状态 
kill -9 [PID]  
-9 表示强迫进程立即停止
参数简介： 
ps [选项] 
-e 显示所有进程,环境变量 
-f 全格式 
-h 不显示标题 
-l 长格式 
-w 宽输出 
a 显示终端上地所有进]]></description><category></category></item></channel></rss>