題目： A message containing letters from A-Z is being encoded to numbers using the following mapping way: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Beyond that, now the encoded string can also contain the character ‘*’, whic

Leetcode打卡目錄 摘自小詹學Python

大家好！相信讀者你絕對想不到，我們居然出了一個Leetcode的系列。jekins教程？從去年7月到現在，我已經在北京的互聯網公司呆了整整一年的時間。這中間經歷過各種各樣的酸甜苦辣，自己為了面試刷題的過程（從杉數到滴滴——未入門算法工程師再

Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 思考：快慢指針，快指針一次走兩步，慢指針一次一步。若快指針跟慢指針指向同一個結點，則有環。若快指針到達鏈表末尾即指向NULL

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

原題鏈接在這里：https://leetcode.com/problems/word-ladder/ leetcode70。題目： Given two words (beginWord?and?endWord), and a dictionary's word list, find the length of shortest transformation sequence from?beginWord?to?endWord, such that:

題目連接 https://leetcode.com/problems/course-schedule-ii/?? Course Schedule II Description There are a total of n courses you have to take, labeled from 0 to n - 1. leetcode 課程表？Some courses may have prerequisites, for example to take course 0 you ha