![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
递归
LUCASYAN个
这个作者很懒,什么都没留下…
展开
-
638. Shopping Offers 深度优先遍历、递归、存储技术(基于递归的动态规划)
Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k from digits of the two. The relative order of the digits from the same array must原创 2017-09-05 00:07:56 · 251 阅读 · 0 评论 -
576. Out of Boundary Paths
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to原创 2017-09-05 00:07:37 · 197 阅读 · 0 评论 -
494. Target Sum
You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol. Find out原创 2017-09-12 23:34:56 · 147 阅读 · 0 评论