原创 如何學習一門新的技術?

學習方法: 第一大步: 認知,瞭解 瞭解百科定義 解決了什麼問題 同類技術有哪些 瞭解技術組成部分 思考爲什麼技術會出現 第二大步: 學語法,學用法 視頻 博客 權威書 文檔 第三大步: 局部練習, 小型實戰,搭建環境 遇到坑 多思考

原创 Race Car

Your car starts at position 0 and speed +1 on an infinite number line.  (Your car can go into negative positions.) Your

原创 Shortest Subarray with Sum at Least K

Return the length of the shortest, non-empty, contiguous subarray of A with sum at least K. If there is no non-empty su

原创 Valid Mountain Array

Given an array A of integers, return true if and only if it is a valid mountain array. Recall that A is a mountain arra

原创 Number of Submatrices That Sum to Target

Given a matrix, and a target, return the number of non-empty submatrices that sum to target. A submatrix x1, y1, x2, y2

原创 Stone Game III

Alice and Bob continue their games with piles of stones. There are several stones arranged in a row, and each stone has

原创 Positions of Large Groups

In a string S of lowercase letters, these letters form consecutive groups of the same character. For example, a string

原创 Valid Word Abbreviation

Given a non-empty string s and an abbreviation abbr, return whether the string matches with the given abbreviation. A s

原创 Smallest Sufficient Team

In a project, you have a list of required skills req_skills, and a list of people.  The i-th person people[i] contains

原创 Minimum Insertion Steps to Make a String Palindrome

Given a string s. In one step you can insert any character at any index of the string. Return the minimum number of ste

原创 Tiling a Rectangle with the Fewest Squares

Given a rectangle of size n x m, find the minimum number of integer-sided squares that tile the rectangle. Example 1:

原创 Strong Password Checker

A password is considered strong if below conditions are all met: It has at least 6 characters and at most 20 characters

原创 All O`one Data Structure

Implement a data structure supporting the following operations: Inc(Key) - Inserts a new key with value 1. Or increment

原创 Maximum Profit in Job Scheduling

We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i

原创 Minimum Cost to Make at Least One Valid Path in a Grid

Given a m x n grid. Each cell of the grid has a sign pointing to the next cell you should visit if you are currently in