https://blog.youkuaiyun.com/DINGGUOZIzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/DINGGUOZI/article/details/22515703https://blog.youkuaiyun.com/DINGGUOZI/article/details/22515703DINGGUOZISat, 29 Mar 2014 21:25:57 +0800https://blog.youkuaiyun.com/DINGGUOZI/article/details/6568922https://blog.youkuaiyun.com/DINGGUOZI/article/details/6568922DINGGUOZISun, 26 Jun 2011 19:43:00 +0800https://blog.youkuaiyun.com/DINGGUOZI/article/details/6095148https://blog.youkuaiyun.com/DINGGUOZI/article/details/6095148DINGGUOZIThu, 23 Dec 2010 21:17:00 +0800https://blog.youkuaiyun.com/DINGGUOZI/article/details/5965293https://blog.youkuaiyun.com/DINGGUOZI/article/details/5965293DINGGUOZIMon, 25 Oct 2010 22:27:00 +0800https://blog.youkuaiyun.com/DINGGUOZI/article/details/5956957https://blog.youkuaiyun.com/DINGGUOZI/article/details/5956957DINGGUOZIThu, 21 Oct 2010 16:27:00 +0800https://blog.youkuaiyun.com/DINGGUOZI/article/details/5954668https://blog.youkuaiyun.com/DINGGUOZI/article/details/5954668DINGGUOZIWed, 20 Oct 2010 17:25:00 +0800 /* 淘宝笔试题： 给定一个字符串， 比如"我爱alibaba", 写个函数截取字符串， 比如：我截取前5个字节， 为 “我爱a”， 接3个字节， 就是 “我爱", 半个汉字的就必须截取完 */ #include #include char* subString(const char* str, int nSubLength) { if (str == nullptr) return nullptr; int nLength = ]]>https://blog.youkuaiyun.com/DINGGUOZI/article/details/5954636https://blog.youkuaiyun.com/DINGGUOZI/article/details/5954636DINGGUOZIWed, 20 Oct 2010 17:20:00 +0800/* google笔试题 n支队伍比赛，分别编号为0，1，2。。。。n-1，已知它们之间的实力对比关系，存储在一个二维数组w[n][n]中，w[i][j] 的值代表编号为i，j的队伍中更强的一支 所以w[i][j]=i 或者j，现在给出它们的出场顺序，并存储在数组order[n]中， 比如order[n] = {4,3,5,8,1......}，那么第一轮比赛就是 4对3， 5对8。。。。。。 胜者晋级，败者淘汰，同一轮淘汰的所有队伍排名不再细分，即可以随便排， 下一轮由上一轮的胜者]]>https://blog.youkuaiyun.com/DINGGUOZI/article/details/4240552https://blog.youkuaiyun.com/DINGGUOZI/article/details/4240552DINGGUOZIWed, 03 Jun 2009 22:39:00 +0800