(●—●)

《剑指Offer》 P151面试题27：二叉搜索树与双向链表题目输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点，只能调整树中结点指针的指向。

《CTCI》 P1423 栈与队列题目3.5 实现一个MyQueue类，该类用两个栈来实现一个队列。解答#include <stack>template <typename T> class queue{public: void push(const T& val); void pop(); const T& front(); const T& back();

《剑指Offer》 P154面试题28：字符串的排列题目解答//面试题28：字符串的全排列#include <string>#include <iostream>#include <Windows.h>using namespace std;void permutation(string s,int start,int &num){ if (start == s.size() - 1)

《CITI》P12 链表题目：2.7 Implement a function to check if a linked list is a palindrome

《CITI》P1182 链表题目：2.2 Implement an algorithm to find the kth to last element of a singly linked list.

《CITI》P1232 链表题目：2.5 You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1 ‘s digit is at the head of the l

《CITI》P1262 链表题目：2.6 Given a circular linked list, implement an algorithm which returns the node at the beginning of the loop.

《CITI》P12 链表题目：2.3 Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.

《CITI》P1212 链表题目：2.4 Write code to partition a linked list around a value x, such that all nodes less than x come before alt nodes greater than or equal to x.

《CITI》P1172 链表题目：2.1 Write code to remove duplicates from an unsorted linked list. FOLLOW UP How would you solve this problem if a temporary buffer is not allowed?

《CITI》P1161 数组与字符串题目：1.8 Assume you have a method isSubstring which checks if one word is a substring of another. Given two strings, si and s2, write code to check Ifs2 is a rotation of si using only o

《CITI》P1151 数组与字符串题目：1.7 Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0.

LeetCode26 Remove Duplicates from Sorted Array题目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 an

LeetCode80 Remove Duplicates from Sorted Array II题目Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice?For example, Given sorted array nums = [1,1,1,2,2,3],Your function s

LeetCode1.TwoSumGiven an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the

《CITI》P1373 栈与队列题目：3.3 Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when the previous stack exceeds some

《CTCI》 P1403 栈与队列题目3.4 In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending o

《剑指Offer》 P147面试题26：复杂链表的复制题目请实现函数ComplexListNode* Clone(ComplexListNode* pHead)，复制一个复杂链表。在复杂链表中，每个结点除了有一个m_pNext指针指向下一个结点外，还有一个m_pSibling指向链表中的任意结点或者NULL。结点的C++定义如下：struct ComplexListNode{ int m_

//面试题33：把数组排成最小的数#include <iostream>#include <vector>#include <string>#include <sstream>#include <Windows.h>using namespace std;const int prec = numeric_limits<long double>::digits10;//模板函数：类型转换

LeetCode36 Valid Sudoku题目Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.A parti

《CITI》P1453 栈与队列题目：3.7 An animal shelter holds only dogs and cats, and operates on a strictly “first in, first out” basis. People must adopt either the “oldest” (based on arrival time) of all animals a

《CITI》P1433 栈与队列题目：3.6 Write a program to sort a stack in ascending order (with biggest items on top). You may use at most one additional stack to hold items, but you may not copy the elements into any

LeetCode2 Add Two Numbers题目You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbe

LeetCode3 Longest Substring Without Repeating Characters题目Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating let

《CITI》P1141 数组与字符串题目：1.6 Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do this in place?

《CITI》P1121 数组与字符串题目：1.5 Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the “compressed” s

《剑指Offer》 P132面试题21：包含min函数的栈题目：

《剑指Offer》 P117面试题18：树的子结构题目：

《剑指Offer》 P114面试题17：合并两个排序的链表题目：

《剑指Offer》 P112面试题16：反转链表题目：

《剑指Offer》 P102面试题14：调整数组顺序使奇数位于偶数前面题目：

《剑指Offer》 P94面试题12：打印1到最大的n位数题目：

《剑指Offer》 P51面试题5：从尾到头打印链表题目：

《剑指Offer》 P66面试题8：旋转数组的最小数字题目：

《剑指Offer》 P44面试题4：替换空格题目：

《剑指Offer》 P55面试题6：重建二叉树题目：

《剑指Offer》 P59面试题7：用两个栈实现队列题目：

《剑指Offer》 P140面试题24：二叉搜索树的后序遍历序列题目：

《剑指Offer》 P134面试题22：栈的压入，弹出序列题目：

《剑指Offer》 P137面试题23：从上到下打印二叉树题目：