摘要：
一直想留下一些阿里推荐算法比赛的感悟，但是一直给自己找推托的理由T_T，并不是没有总结而是一直未在博客上更新，今天放出来分享一下。# 本人参加了阿里巴巴两次推荐算法比赛，主题分别是天猫品牌推荐、移动端商品推荐。1. 天猫品牌推荐 -比赛网址个人实践流程：1）分析问题给定四个月的用户行为数据，预测用户... 阅读全文
摘要：
DescribeBesides the realization of tradictional binary tree based on recursion or stack, which needs O(n) space complexity, there also exit one struct... 阅读全文
摘要：
DescribeGiven one integer array, you have to find out two disjoint continuous sub-array A and B, which maximate the absolute value of SUM(A)-SUM(B).Fo... 阅读全文
摘要：
DescribeSample K elements in N data, and N is not sure.Imaging one setting: there is one continuous infinite data flow coming one after another, and w... 阅读全文
摘要：
DescribeThere is one integer array and you must find out one subset that contains the maximum continuous numbers with time complexity O(n).E.g. imput-... 阅读全文
摘要：
DescribeTwo players would like to pick up some from one heap of stones. Assume the quantity of stones is 100 and these two men pick up some one by one... 阅读全文
摘要：
DescribeGive you a log of searching that contains N words, how to find out one key word which appears over N/2 times (definitely exists), just using O... 阅读全文
摘要：
高精度整形数封装类。 操作符>注意使用友元标记，否则编译错误。#include #include #include using namespace std;struct bign { vector num; bign() { num.push_back... 阅读全文
摘要：
1. 标准输入输出scanf()返回值为输入变量个数，终止输入使用Ctrl+z（等于输入EOF或-1）。#includeint main() { int x; while (scanf("%d", &x) == 1) { printf("%d\n", x); } return 0;}cin返回值为... 阅读全文
摘要：
软件环境：VMware 7.1；CRUX-2.6；gdb-7.0a 内核编译及KGDB安装详见http://www.cnblogs.com/awarrior/p/3343310.html 1. 预备 本文默认内核已安装了KGDB。如果系统没有gdb工具，先去下载一个最新版本的gdb：htt... 阅读全文