amanda的博客

最大堆，最小堆 最大堆：每个节点的孩子节点都小于该节点 最小堆：每个节点的孩子节点都大于该节点 由于堆是一棵完全二叉树，所以 如果堆中的节点i有左右孩子节点，则： 左孩子节点：i x 2 + 1 右孩子节点：i x 2 + 2 如果堆中的节点j有父节点，则： 父节点：(j-1)/2 建立最大堆： void AdjustHeap(std::vector<int> & heap, int cur, int length) { int left = cur * 2 + 1..

题目： 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

[leetcode刷题 C++] 2. Add Two Numbers 题目 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a singl...

[leetcode刷题 C++] 1. Two Sum 题目 Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solutio...

[leetcode刷题 C++] 3. Longest Substring Without Repeating Characters 题目 Given a string, find the length of the longest substring without repeating characters. Example 1: Input: &amp;quot;abcabcbb&amp;quot; Output: 3 ...

[leetcode刷题 C++] 5. Longest Palindromic Substring 题目 Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" O...