Qiana_wq的博客

题目描述：Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use...

题目描述：Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.题目解析： //题目：construct-binary-tree-from-inorder-a...

题目描述：Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.题目解析：...

题目描述：Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3 return[1,2,3].Note: Recursive solution i...

题目描述：Given a linked list, remove the n th node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second nod...

题目描述：Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given1->2->3->4->5->NULLand k =2,return4->5->1->2->3->NULL.题目解析：...

题目描述：You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as...

题目描述：Given a singly linked list L: L 0→L 1→…→L n-1→L n,reorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→…You must do this in-place without altering the nodes' values.For example,Given{1,2,3,4}, reo...

题目描述：Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in ea...

题目描述：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.题目解析：通过快慢指针找到链表的中点，作为二叉搜素树的根节点。以中点为界，将链表分为两部分，不包含中点，分别对两部分链表递归调用原函数，最后连上根节点的左右子树...

题目描述：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4],...

题目描述：Sort a linked list in O(n log n) time using constant space complexity.题目解析：使用O(nlogn)的算法排序数组。O(nlogn)的排序算法有快速排序，归并排序，堆排序。这里使用归并排序。归并排序的一般步骤为：（1）将待排序链表，取中点，一分为二；（2）递归地对左半部分进行归并排序；（3）...

题目描述：Given a collection of intervals, merge all overlapping intervals. For example, Given[1,3],[2,6],[8,10],[15,18], return[1,6],[8,10],[15,18].解题思路：    题目的意思是：一个vector中存着Interval对象，Interval是一个结构体，...

题目描述：Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log n). If the target is not f...

题目描述：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 order. You may assume no duplicates in the ...

题目描述：Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].Note: Recursive solution is tr...