You want to schedule a list of jobs in d days. Jobs are dependent (i.e To work on the i-th job, you have to finish all the jobs j where 0 <= j < i). 有更新！ 1335. Minimum Difficulty of a Job Schedule leetcode
当golang程序在运行过程中消耗了超出预期内存时，需要搞明白，到底是程序中哪些代码导致了这些内存消耗。此时，通常可以采用golang的pprof来分析golang进程的内存使用。 有更新！ golang 内存分析/内存泄漏 golang
Given an m x n grid of characters board and a string word, return true if word exists in the grid. 79. 单词搜索 leetcode
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. 有更新！ LinkedList - 25. Reverse Nodes in k-Group leetcode
Given two strings text1 and text2, return common subsequence. If there is no common subsequence, return 0. 有更新！ 1143. Longest Common Subsequence dp
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. 有更新！ Array - 88. Merge Sorted Array leetcode
A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.Construct a deep copy of the list. 138. Copy List with Random Pointer leetcode
Given a string s, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. 有更新！ Palindrome - 125. Valid Palindrome leetcode
The n-queens puzzle is the problem of placing n queens on an n_×_n chessboard such that no two queens attack each other. 有更新！ DFS&BFS - 51. N-Queens leetcode
Coin Change You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1. Example 1: Input: coins = [1, 2, 5], amount = 11 Output: 3 Explanation: 11 = 5 + 5 + 1 Example 2: Input: coins = [2], amount = 3 Output: -1 Note: You may assume that you have an infinite number of each kind of coin. 思路： .... 有更新！ Dynamic Programming - 322. Coin Change leetcode
You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). 有更新！ Array - 48. Rotate Image leetcode
Given an m x n matrix. If an element is 0, set its entire row and column to 0. Do it in-place. 73. Set Matrix Zeroes leetcode
Given a collection of intervals, merge all overlapping intervals. 有更新！ Array - 56. Merge Intervals leetcode
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 有更新！ LinkedList - 23. Merge k Sorted Lists leetcode
whistle