<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[天天烤代码]]></title><description><![CDATA[Give me code.]]></description><link>https://blog.youkuaiyun.com/tbestcc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; tbestcc]]></copyright><item><title><![CDATA[Champagne Tower - leetcode 799]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/79576220</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/79576220</guid><author>tbestcc</author><pubDate>Fri, 16 Mar 2018 06:20:40 +0800</pubDate><description><![CDATA[题目大意：金字塔形的杯子排列，由最上面的杯子开始灌水，水在灌满杯子后，溢出的水会均匀流到脚下的两个杯子中。给定灌水量和由i，j 确定的杯子的位置，求这个杯子的灌水量。题目分析：给定了杯子的坐标，只要由上到下依次求出和这个杯子有关的杯子的灌水量即可，放在边缘的杯子只有一个水源，而放在里面的杯子有两个水源。AC code：(Ruby)def champagne_tower(poured, query_...]]></description><category></category></item><item><title><![CDATA[Letter Case Permutation leetcode 784]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/79337466</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/79337466</guid><author>tbestcc</author><pubDate>Mon, 19 Feb 2018 17:14:20 +0800</pubDate><description><![CDATA[题目大意：字符串中每一个字母(A-Za-z)的大小写不同视为不同的字母大小写排列，给定一个字符串，返回所有的排列。题目分析：字符串中如果有 n 个字母，返回的结果就会有 2^n 种。可以使用迭代或递归来遍历 2^n 种情况，但是代码会多一些。看过了discussion 后，发现了 2 行 的 python 写法，利用 product 函数来将结果积起来。下面给出一种 Ruby 的写法，只需要一行。...]]></description><category></category></item><item><title><![CDATA[K-diff Pairs in an Array leetcode 532]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/60736048</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/60736048</guid><author>tbestcc</author><pubDate>Tue, 07 Mar 2017 08:22:28 +0800</pubDate><description><![CDATA[原来统计数组也很简单，只是要多多实践。]]></description><category></category></item><item><title><![CDATA[leetcode 501 Find Mode in Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/54888660</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/54888660</guid><author>tbestcc</author><pubDate>Mon, 06 Feb 2017 03:27:15 +0800</pubDate><description><![CDATA[第一次使用ruby来解决据结构相关的题目。]]></description><category></category></item><item><title><![CDATA[mac book更改caps lock键为esc键/ctrl键]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/52287622</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/52287622</guid><author>tbestcc</author><pubDate>Tue, 23 Aug 2016 08:30:31 +0800</pubDate><description><![CDATA[快速更改，不拖泥带水]]></description><category></category></item><item><title><![CDATA[MySQL INFORMATION_SCHEMA -- COLUMNS Table]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/51433083</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/51433083</guid><author>tbestcc</author><pubDate>Tue, 17 May 2016 06:00:59 +0800</pubDate><description><![CDATA[INFORMATION_SCHEMA库中，存储了与这个数据库server有关的信息，比如库中所有table的表信息、所有字段的表信息、访问权限等等。]]></description><category></category></item><item><title><![CDATA[预定义宏 ANSI C]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/51432615</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/51432615</guid><author>tbestcc</author><pubDate>Tue, 17 May 2016 03:09:29 +0800</pubDate><description><![CDATA[C编译器的预定义宏，可以方便的打印程序信息，方便调试。]]></description><category></category></item><item><title><![CDATA[Power of Four leetcode 342]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/51216457</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/51216457</guid><author>tbestcc</author><pubDate>Fri, 22 Apr 2016 02:02:36 +0800</pubDate><description><![CDATA[题目大意：不用循环和递归，确定一个有符号整形是否是4的幂。
分析：用位运算来算。]]></description><category></category></item><item><title><![CDATA[Flatten Nested List Iterator leetcode 341]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/51168628</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/51168628</guid><author>tbestcc</author><pubDate>Sat, 16 Apr 2016 16:19:16 +0800</pubDate><description><![CDATA[题目大意： 解嵌套，将一个数据可嵌套的类的整型值序列化。
思路：遍历一棵多叉树，如果是叶子节点就把结果加在list中，如果不是，就继续遍历子节点。]]></description><category></category></item><item><title><![CDATA[Counting Bits leetcode 338]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/51156315</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/51156315</guid><author>tbestcc</author><pubDate>Fri, 15 Apr 2016 00:24:02 +0800</pubDate><description><![CDATA[题目大意：计算数字的二进制中'1'的个数。
计算'1'的个数是常见的题目了，x&x-1把最右边的1变成0 ， y | y+1把最右边的0变成1。]]></description><category></category></item><item><title><![CDATA[Odd Even Linked List leetcode 328]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/50530271</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/50530271</guid><author>tbestcc</author><pubDate>Sat, 16 Jan 2016 23:44:43 +0800</pubDate><description><![CDATA[提莫大意：找出第偶数个结点，将他们挑出来，加入到奇数序号结点序列的后面。]]></description><category></category></item><item><title><![CDATA[git 使用]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/50501395</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/50501395</guid><author>tbestcc</author><pubDate>Tue, 12 Jan 2016 03:27:59 +0800</pubDate><description><![CDATA[Git 常用命令]]></description><category></category></item><item><title><![CDATA[解决linux 命令行乱码]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/50444270</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/50444270</guid><author>tbestcc</author><pubDate>Fri, 01 Jan 2016 02:10:59 +0800</pubDate><description><![CDATA[有些命令的中文显示结果会出乱码.]]></description><category></category></item><item><title><![CDATA[Range Sum Query - Immutable leetcode 303]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/49793501</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/49793501</guid><author>tbestcc</author><pubDate>Thu, 12 Nov 2015 03:02:51 +0800</pubDate><description><![CDATA[题目大意：根据下标，求数组内区间的部分和。
重新弄了个临时数组m，来存储从0到k的和，这样总和减去前一部分的和就可以快速得到答案了。]]></description><category></category></item><item><title><![CDATA[Bulls and Cows leetcode 299]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/49544925</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/49544925</guid><author>tbestcc</author><pubDate>Sun, 01 Nov 2015 02:03:31 +0800</pubDate><description><![CDATA[题目大意：统计位置正确的个数，和统计出现次数正确的个数。]]></description><category></category></item><item><title><![CDATA[Find Median from Data Stream  leetcode 295]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/49258905</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/49258905</guid><author>tbestcc</author><pubDate>Tue, 20 Oct 2015 00:13:49 +0800</pubDate><description><![CDATA[题目大意：数据流中不断加入新的整型元素，求已有数据的中位数。]]></description><category></category></item><item><title><![CDATA[Game of Life leetcode 289]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/49132207</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/49132207</guid><author>tbestcc</author><pubDate>Wed, 14 Oct 2015 22:12:41 +0800</pubDate><description><![CDATA[题目大意：
活细胞：2个或3个活的邻域则存活，否则死掉。
死细胞：3个活的邻域，则变为活细胞。]]></description><category></category></item><item><title><![CDATA[Nim Game leetcode 292]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/49090531</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/49090531</guid><author>tbestcc</author><pubDate>Tue, 13 Oct 2015 03:56:02 +0800</pubDate><description><![CDATA[题目大意：博弈论取石子的经典问题，每次最多取1到m个石子。
在初始状态一定的情况下，博弈的结果不是必胜就是必败，所以必败的状态就是剩余4个石子的情况，同样4的倍数都是必败的。
关键要推导出必胜或必败的公式。]]></description><category></category></item><item><title><![CDATA[Majority Element II  leetcode 229]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/48830401</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/48830401</guid><author>tbestcc</author><pubDate>Wed, 30 Sep 2015 16:53:40 +0800</pubDate><description><![CDATA[题目大意：找到个数大于总数三分之一的主元素，O(n)时间复杂度，O(1)空间复杂度。]]></description><category></category></item><item><title><![CDATA[Find the Duplicate Number leetcode 287]]></title><link>https://blog.youkuaiyun.com/tbestcc/article/details/48805003</link><guid>https://blog.youkuaiyun.com/tbestcc/article/details/48805003</guid><author>tbestcc</author><pubDate>Tue, 29 Sep 2015 11:54:16 +0800</pubDate><description><![CDATA[题目大意：找到数组中唯一的一个重复的数值。时间复杂度要小于O(n^2)，不能修改数组了。
发现一个很6的算法，把数组当成一个静态链表，也就是说nums[]，数组相当于next[]，0为起始节点，节点地址范围就是0-n，一共n+1个节点。
因为数组范围是1-n，所以没有节点next会指向0。]]></description><category></category></item></channel></rss>