上一页 1 2 3 4 5 6 7 8 ··· 13 下一页
摘要: When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A "soci 阅读全文
posted @ 2022-01-28 23:14 勇往直前的力量 阅读(60) 评论(0) 推荐(0)
摘要: Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, a 阅读全文
posted @ 2022-01-27 22:59 勇往直前的力量 阅读(28) 评论(0) 推荐(0)
摘要: A registration card number of PAT consists of 4 parts: the 1st letter represents the test level, namely, T for the top level, A for advance and B for 阅读全文
posted @ 2022-01-26 22:08 勇往直前的力量 阅读(40) 评论(0) 推荐(0)
摘要: A proper vertex coloring is a labeling of the graph’s vertices with colors such that no two vertices sharing the same edge have the same color. A colo 阅读全文
posted @ 2022-01-25 23:54 勇往直前的力量 阅读(40) 评论(0) 推荐(0)
摘要: In July 2004, Google posted on a giant billboard along Highway 101 in Silicon Valley (shown in the picture below) for recruitment. The content is supe 阅读全文
posted @ 2022-01-25 21:53 勇往直前的力量 阅读(50) 评论(0) 推荐(0)
摘要: Werewolf(狼人杀) is a game in which the players are partitioned into two parties: the werewolves and the human beings. Suppose that in a game, player #1 阅读全文
posted @ 2022-01-25 21:21 勇往直前的力量 阅读(43) 评论(0) 推荐(0)
摘要: When shipping goods with containers, we have to be careful not to pack some incompatible goods into the same container, or we might get ourselves in s 阅读全文
posted @ 2022-01-24 21:43 勇往直前的力量 阅读(41) 评论(0) 推荐(0)
摘要: The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. A binary search tree (BST) i 阅读全文
posted @ 2022-01-22 23:24 勇往直前的力量 阅读(34) 评论(0) 推荐(0)
摘要: The following is from Max Howell @twitter: Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a 阅读全文
posted @ 2022-01-14 17:48 勇往直前的力量 阅读(58) 评论(0) 推荐(0)
摘要: An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the 阅读全文
posted @ 2022-01-14 16:57 勇往直前的力量 阅读(44) 评论(0) 推荐(0)
上一页 1 2 3 4 5 6 7 8 ··· 13 下一页