Sort a linked list using insertion sort. 鏈表的插入排序，其實有2種特殊情況： 1、插入的值插入到已排序的末尾。 leetcode并查集，2、插入的值插入到已排序的最前端。 主要設置了3個指針。 1、pStart是已排序鏈表的開始位置。 2、pInsert是待插入的位置。 LE

1.兩數之和 解法1：暴力遍歷 class Solution { public:vector<int> twoSum(vector<int>& nums, int target) {for(int i=0;i<nums.size();i++){for(int j=i+1;j<nums.size();j++){if(nums[i]+nums[j]==t

1.題目描述 Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. 給一個數字字符串，返回所有可能的字母組合。 leetcode all in

題目描述：(鏈接) Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. 解題思路: 上代碼 1 class Solution { 2 public: 3 vector<

某城市開了一家新的電影院，吸引了很多人過來看電影。該電影院特別注意用戶體驗，專門有個 LED顯示板做電影推薦，上面公布著影評和相關電影描述。 作為該電影院的信息部主管，您需要編寫一個 SQL查詢，找出所有影片描述為非 boring (不無聊) 的

Employee 表包含所有員工，他們的經理也屬于員工。每個員工都有一個 Id，此外還有一列對應員工的經理的 Id。 IdNameSalaryManagerId1Joe7000032Henry8000043Sam60000NULL4Max90000NULL 給定 Employee 表，編寫一個 SQL 查詢，該查詢可以獲取收入超過

Minimum Path Sum Given a?m?x?n?grid filled with non-negative numbers, find a path from top left to bottom right which?minimizes?the sum of all numbers along its path. Note:?You can only move either down or right at any point in time. 動態規劃即可，

題目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory. leetcode70。 For example, Gi

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. leetcode121？For example,Given?{1,2,3,4}, reorder it to?{1,4,2,3}. ? 看上去有點難，實際

題目如下： Given two integers?n?and?k, you need to construct a list which contains?ndifferent positive integers ranging from?1?to?n?and obeys the following requirement:?Suppose this list is [a1, a2, a3, ... , an], then the list [|a1?- a2|, |a2?- a3|