Given a list, rotate the list to the right by?k?places, where?k?is non-negative. For example:Given?1->2->3->4->5->NULL?and?k?=?2,return?4->5->1->2->3->NULL. 思考:先首尾連成環,head前進(len-k%len)步,拆環
Sort a linked list using insertion sort. 鏈表的插入排序,其實有2種特殊情況: 1、插入的值插入到已排序的末尾。 leetcode并查集,2、插入的值插入到已排序的最前端。 主要設置了3個指針。 1、pStart是已排序鏈表的開始位置。 2、pInsert是待插入的位置。 LE
題目: Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 解題思路: 前序遍歷序列的第一個元素肯定為根節點;然后再在中序遍歷序列中找到該節點,并以
? Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. ? leetcode 最長公共子序列?這道題要求用先序和中序遍歷來建立二叉樹,跟之前那道Construct Binary Tree from Inorde
Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 → a2 ↘ c1 → c2 → c3 ↗ B: b1 → b2 → b3 begin to intersect at node c1. /*** Definition for singly-linked
原題鏈接在這里:https://leetcode.com/problems/remove-k-digits/description/ 題目: Given a non-negative integer?num?represented as a string, remove?k?digits from the number so that the new number is the smallest possible. Note: The length of?nu