总结沉淀

加密技术加密技术是对信息进行编码和解码的技术，编码是把原来可读信息（又称明文）译成代码形式（又称密文），其逆过程就是解码（解密），加密技术的要点是加密算法，加密算法可以分为三类： 1. 对称加密 2. 非对称加密 3. 不可逆加密对称加密算法加密过程： 将明文分成N个组，然后对各个组进行加密，形成各自的密文，最后把所有的分组密文进行合并，形成最终的密文。优点： 算法公开、计算量小、加密

Count 1 in BinaryDescriptionCount how many 1 in binary representation of a 32-bit integer. Noitce If you are using Java or Python，please use characters array instead of string.ExampleGiven 32, re

Reverse Linked ListDescriptionReverse a linked list.ExampleFor linked list 1->2->3, the reversed linked list is 3->2->1ChallengeReverse it in-place and in one-pass实现思路注意边界条件head和head.next。定义cur = hea

Find Minimum in Rotated Sorted ArrayDescriptionSuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Notice You may assume no d

Construct Binary Tree from Preorder and Inorder TraversalDescriptionConstruct Binary Tree from Preorder and Inorder Traversal Notice You may assume that duplicates do not exist in the tree.Examp

Search a 2D MatrixDescriptionWrite an efficient algorithm that searches for a value in an m x n matrix.This matrix has the following properties: * Integers in each row are sorted from left to right.

Implement Queue by Two StacksDescriptionAs the title described, you should only use two stacks to implement a queue’s actions.The queue should support push(element), pop() and top() where pop is pop th

Partition Array by Odd and EvenDescriptionPartition an integers array into odd number first and even number second.ExampleGiven [1, 2, 3, 4], return [1, 3, 2, 4]ChallengeDo it in-place.实现思路可以利用快排的思路，左

Search a 2D Matrix IIDescriptionWrite an efficient algorithm that searches for a value in an m x n matrix, return the occurrence of it.This matrix has the following properties:Integers in each row are

BackpackDescriptionGiven n items with size Ai, an integer m denotes the size of a backpack. How full you can fill this backpack? ExampleIf we have 4 items with size [2, 3, 5, 7], the backpack size is 1

Backpack IIDescriptionGiven n items with size Ai and value Vi, and a backpack with size m. What’s the maximum value can you put into the backpack?NoticeYou cannot divide item into small pieces and the

Longest Common SubstringDescriptionGiven two strings, find the longest common substring.Return the length of it.NoticeThe characters in substring should occur continuously in original string. This is d

Longest Common SubsequenceDescriptionGiven two strings, find the longest common subsequence (LCS).Your code should return the length of LCS.ClarificationWhat’s the definition of Longest Common Subseque

Kth Largest ElementDescriptionFind K-th largest element in an array.NoticeYou can swap elements in the arrayExampleIn array [9,3,2,4,8], the 3rd largest element is 4.In array [1,2,3,4,5], the 1st large

Space ReplacementDescriptionWrite a method to replace all spaces in a string with %20. The string is given in a characters array, you can assume it has enough space for replacement and you are given th

FibonacciDescriptionFind the Nth number in Fibonacci sequence.A Fibonacci sequence is defined as follow:The first two numbers are 0 and 1.The i th number is the sum of i-1 th number and i-2 th number.

Fizz BuzzDescriptionGiven number n. Print number from 1 to n. But:when number is divided by 3, print "fizz".when number is divided by 5, print "buzz".when number is divided by both 3 and 5, print "fi

Find Minimum in Rotated Sorted ArrayDescriptionSuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.Notice

SubtreeDescriptionYou have two every large binary trees: T1, with millions of nodes, and T2, with hundreds of nodes. Create an algorithm to decide if T2 is a subtree of T1. NoticeA tree T2 is a subtree

Remove Nth Node From End of ListDescriptionGiven a linked list, remove the nth node from the end of list and return its head.NoticeThe minimum number of nodes in list is n.ExampleGiven linked list: 1->

Print Numbers by RecursionDescriptionPrint numbers from 1 to the largest number with N digits by recursion.Notice It’s pretty easy to do recursion like:recursion(i) { if i > largest number:

Fast PowerDescriptionCalculate the an % b where a, b and n are all 32bit integers.ExampleFor 231 % 3 = 2 For 1001000 % 1000 = 0ChallengeO(logn)实现思路最直接的思路是直接进行n次循环，每次执行: a = (a*a) % b运算，时间复杂度为o(n)。 除

Binary Tree Path SumDescriptionGiven a binary tree, find all paths that sum of the nodes in the path equals to a given number target.A valid path is from root node to any of the leaf nodes.ExampleGiven

Binary Tree Level Order TraversalDescriptionGiven a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).ExampleGiven binary tree {3,9,20,#,#,15,

Copy List with Random PointerDescriptionA linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list

Min StackDescriptionImplement a stack with min() function, which will return the smallest number in the stack.It should support push, pop and min operation all in O(1) cost.Noticemin operation will nev

Majority NumberDescriptionGiven an array of integers, the majority number is the number that occurs more than half of the size of the array. Find it.It should support push, pop and min operation all in

Maximum SubarrayDescriptionGiven an array of integers, find a contiguous subarray which has the largest sum.NoticeThe subarray should contain at least one number.ExampleGiven the array [−2,2,−3,4,−1,2,

getIntersectionNodeDescriptionWrite a program to find the node at which the intersection of two singly linked lists begins.NoticeIf the two linked lists have no intersection at all, return null.The li

Reorder array to construct the minimum numberDescriptionConstruct minimum number by reordering a given non-negative integer array. Arrange them such that they form the minimum number.NoticeThe result m

Digit CountsDescriptionCount the number of k’s between 0 and n. k can be 0 - 9.Exampleif n = 12, k = 1 in[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]we have FIVE 1’s (1, 10, 11, 12)实现思路本题最简单的实现，就是遍历一个1~n