Given a singly linked list L. Let us consider every K nodes as a block (if there are less than K nodes at the end of the list, the rest of the nodes are still considered as a block). Your job is to reverse all the blocks in L. For example, given L as 1→2→3→4→5→6→7→8 and K as 3, your output must b…

When your interviewer asks you to write “Hello World” using C, can you do as the following figure shows?

Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, a binary tree can be uniquely determined.

Telefraud（电信欺骗） remains a common and persistent problem in our society. In some cases, unsuspecting victims lose their entire life savings. To stop this crime, you are supposed to write a program to detect those suspects from a huge amount of phone call records.

Zhejiang University is about to celebrate her 122th anniversary in 2019. To prepare for the celebration, the alumni association （校友会） has gathered the ID’s of all her alumni. Now your job is to write a program to count the number of alumni among all the people who come to the celebration.

Sexy primes are pairs of primes of the form (p, p+6), so-named since “sex” is the Latin word for “six”. (Quoted from [链接])

给定一颗N个节点的齐全二叉树的档次序列，须要输入该树的所有从根节点到叶子节点的门路(优先拜访右子树),而后判断是否是堆，如果不是输入Not Heap，否则输入Max Heap或者Min Heap。

咱们应用set diff_colors保留每一次输出的每一个顶点，其大小就是不同顶点的个数，而后遍历每一条边，如果呈现一条边的2个顶点色彩雷同的状况，阐明不存在k-coloring，输入No,否则输入diff_colors汇合的大小。

应用字符串s承受输出的字符串，并枚举每个k位的子串(起始地位从0到L-K)，而后再转换成整数，判断是否是素数，如果是就间接输入并退出程序。如果不存在就输入404.

咱们借鉴建树的递归过程实现树的局部搜寻，如果以后搜寻的子树的根节点和查问节点U和V相等，阐明其中之一就是先人，间接保留并返回即可，否则获取U和V是否在左子树或者右子树的标记，如果都在左子树，那么就都往左子树搜寻，如果都在右子树，那么就都往右子树搜寻，否则阐明以后子树的根节点就是U和V的最近公共先人，直…