zhangxt_的博客

dfd

二分查找求解单调递增函数的解 题目（欧拉45题） Triangle, pentagonal, and hexagonal numbers are generated by the following formulae: Triangle Tn=n(n+1)/2 1, 3, 6, 10, 15, … Pentagonal Pn=n(3n−1)/2 1, 5, 12, 22, 35, ...

题目 Write an algorithm to determine if a number is “happy”. A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares...

题目 Remove all elements from a linked list of integers that have value val. Example: Input: 1->2->6->3->4->5->6, val = 6 Output: 1->2->3->4->5 分析 本题属于典型的链表节点删除题目，使用虚拟头节...

题目 Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL 分析 定义虚拟头节点以及p,q两个指针变量，完成每一步的翻转操作 这里的虚拟头节点ret并没有指向head,而是充当了中间过度变量的作用 代...

题目 Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number,...