Tag：Tao Ti

[leetcode] 57 – II. Sequence of continuous positive numbers with sum s
1. Input a positive integer target and output all the continuous positive integer sequences (at least two numbers) whose sum is target. The numbers in the sequence are arranged from small to large, and different sequences are arranged from small to large according to the first number. Example 1: Input: target = 9 Output: [[2,3,4], […]

Leetcode 37
Before solving this problem, we need to know what is backtracking. Generally speaking, backtracking method is: there are many choices at present, we don’t know which one to choose, so we need to try each one. Every path you try to connect will get a tree solution. For example, in the coordinates above[0,2]Through observation, we […]

Weeks 4 of Arts  longest ascending subsequence of leetcode 1143  21 days can you learn how to program  go defer usage
ARTS Arts is an activity launched by Chen Hao in the geek time column. The purpose is to keep learning through sharing. Each person writes an arts every week: algorithm is an algorithm problem, review is to read an English article, technology / tips is to share a small technology, share is to share a […]