摘要：
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 题目意思：k个有序链表合并后仍为一个有序链表 解题思路：我先将链表存储在vector中，然后我用新的v 阅读全文
摘要：
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smal 阅读全文
摘要：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You a 阅读全文
摘要：
Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexi 阅读全文
摘要：
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文
摘要：
今天在看王道宝典的时候看到dynamic_cast ,一直都没用过，也不了解，今天来总结一下。 dynamic_cast 和 static_cast 都可以用来强制转换指针类型，但不同的是dynamic_cast在进行类层次间的下行转换时更加安全。 dynamic_cast 运算符可以在执行期决定真 阅读全文