golden_dreams的博客

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}, reorder it to{1,

问题描述：   Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are+,-,*,/. Each operand may be an integer or another expression. Some examples:   ["2",

问题描述： Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. //提供一棵二叉树，找到它的最小深度（最小深度指的是树

问题描述：   Sort a linked list in O(n log n) time using constant space complexity. 归并排序： 1.将链表平均分成两部分找到链表中间结点（findMddle） 快慢指针思路，快指针一次走两步，慢指针一次走一步，快指针在链表末尾时，慢指针恰好在链表中点   2.对左右部分分别归并排序 3.合并左右部分（同时

问题描述： Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. 在一个给定的n个点的平面，求在相同的直线最多的点的点数。           class Solution { public:     int maxPoints(v

Sort a linked list using insertion sort. 排序一个list使用插入排序的方法 问题解决: class Solution { public:     ListNode *insertionSortList(ListNode *head) {         if(!head || !head->next) return head;

Given a binary tree, return the postorder traversal of its nodes' values. 问题解决： class Solution { public:     void postOrder(TreeNode *root,vector&vec){         if(root != NULL){