angelina525的专栏

题目：输入一棵二元查找树，将该二元查找树转换成一个排序的双向链表。要求不能创建任何新的节点，只调整指针的指向。  解题原理：节点10的左指针应该指向其左子树值最大的节点8,节点8的右指针应该指向节点10，节点10的右指针应该指向其右子树的最小节点12，节点12的左指针应该指向节点10。因此采用需找pCurrent节点左子树的最大节点leftMaxNode，其右子树的最小节点ri

problem:Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, re

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet"

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if

Sort a linked list using insertion sort.此题较简单，就是练习链表增删查问题class Solution {public: ListNode *insertionSortList(ListNode *head) { // IMPORTANT: Please reset any member data you declared,

Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:You

Surrounded RegionsFeb 222901 / 10932Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surro