上一页 1 ··· 17 18 19 20 21 22 23 24 25 ··· 49 下一页
摘要: Recommendation system predicts the preference that a user would give to an item. Now you are asked to program a very simple recommendation system that 阅读全文
posted @ 2018-08-20 17:08 A-Little-Nut 阅读(180) 评论(0) 推荐(0) 编辑
摘要: The "eight queens puzzle" is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solutio 阅读全文
posted @ 2018-08-20 17:04 A-Little-Nut 阅读(148) 评论(0) 推荐(0) 编辑
摘要: Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and ino 阅读全文
posted @ 2018-08-20 17:01 A-Little-Nut 阅读(418) 评论(0) 推荐(0) 编辑
摘要: In graph theory, an Eulerian path is a path in a graph which visits every edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which 阅读全文
posted @ 2018-08-20 16:58 A-Little-Nut 阅读(193) 评论(0) 推荐(0) 编辑
摘要: Given some segments of rope, you are supposed to chain them into one rope. Each time you may only fold two segments into loops and chain them into one 阅读全文
posted @ 2018-08-20 16:54 A-Little-Nut 阅读(146) 评论(0) 推荐(0) 编辑
摘要: John got a full mark on PAT. He was so happy that he decided to hold a raffle(抽奖) for his followers on Weibo that is, he would select winners from eve 阅读全文
posted @ 2018-08-20 16:52 A-Little-Nut 阅读(228) 评论(0) 推荐(0) 编辑
摘要: An AVL tree is a self balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any 阅读全文
posted @ 2018-08-20 16:46 A-Little-Nut 阅读(151) 评论(0) 推荐(0) 编辑
摘要: The "Hamilton cycle problem" is to find a simple cycle that contains every vertex in a graph. Such a cycle is called a "Hamiltonian cycle". In this pr 阅读全文
posted @ 2018-08-20 16:43 A-Little-Nut 阅读(202) 评论(0) 推荐(0) 编辑
摘要: "Damn Single (单身狗)" is the Chinese nickname for someone who is being single. You are supposed to find those who are alone in a big party, so they can 阅读全文
posted @ 2018-08-19 18:29 A-Little-Nut 阅读(243) 评论(0) 推荐(0) 编辑
摘要: Two integers are called "friend numbers" if they share the same sum of their digits, and the sum is their "friend ID". For example, 123 and 51 are fri 阅读全文
posted @ 2018-08-19 18:28 A-Little-Nut 阅读(153) 评论(0) 推荐(0) 编辑
上一页 1 ··· 17 18 19 20 21 22 23 24 25 ··· 49 下一页