![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
-------------算法练习----------
New灬soul
编程,编程,编程。。。。。。。
展开
-
LeetCode 198 House Robber(简单的动态规划)
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house原创 2017-11-17 21:39:14 · 215 阅读 · 0 评论 -
算法初步--求最大子数组和【暴力|优化枚举|贪心 】求解
今天要把算法联系提到日程上了,就从最简单的算法开始学习。介绍一下求解的过程。首先问题是这样的,给定数组a[1…n],求最大子数组和,即找出1题意:int[] arr = {-2,-1,-3,4,-1,2,1,-5,4}; 比如有这样一个数组,求这个数组的子数组加起来的值最大。这里给出三种解法,时间复杂度分别为 O(N^3) O(N^2) O(N),由简单的思路开始,第一种解法,暴力,全部枚原创 2017-11-05 15:45:10 · 992 阅读 · 0 评论