SUN_DRAGON的专栏

http://www.cnblogs.com/exponent/articles/2141477.html http://blog.youkuaiyun.com/swordholy/article/details/4852753 http://wenku.baidu.com/view/8cc03974a417866fb84a8eeb.html http://wenku.baidu.com/view/e9

题意：给一个1*M的棋盘，上面有N颗棋子，每次只能向左移动棋子，并且至少移动一步，两人轮流操作，谁不能移动谁就输了。     分析这题的P/N点时，和往常不一样，不是从小数据推测，而是直接从性质推测，从右往左，把棋子分为两两一组，如果是奇数颗棋子，就补第一颗的位置为0，当对手移动两颗棋子的左边的棋子时，我们只需要把右边这颗棋子移动相同的步数就行，当对手移动右边的棋子时，把两颗棋子之间的距离看

“Sprague-Grundy函数” 我们将面对更多与Nim游戏有关的变种，还会看到Nim游戏的a1^a2^...^an这个值更广泛的意义。 上面的文章里我们仔细研究了Nim游戏，并且了解了找出必胜策略的方法。但如果把Nim的规则略加改变，你还能很快找出必胜策略吗？比如说：有n堆石子，每次可以从第1堆石子里取1颗、2颗或3颗，可以从第2堆石子里取奇数颗，可以从第3堆及以后石子里取任意颗……

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.For example, given s = "aab",Return [ ["aa","b"], ["a","a","

#define EXCHANGE(a, b) (a)=(a)^(b);\ (b)=(b)^(a);\ (a)=(b)^(a) void oddEvenNum(vector& nums) { int oddEnd = 0; int evenEnd = 0; while(evenEnd < nums.size()) { if(nums[evenEnd] % 2) { if(

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find the to

Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is [1, 2, 3,

Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter can be changed at a timeEach intermediate word