-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmax-array-sum.html
More file actions
45 lines (37 loc) · 1.62 KB
/
Copy pathmax-array-sum.html
File metadata and controls
45 lines (37 loc) · 1.62 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
<head><title>max array sum</title>
<link rel="stylesheet" href="/style.css">
</head>
<body>
<link rel="stylesheet" href="/third-party/highlight/solarized-dark.css">
<script src="/third-party/highlight/highlight.js"></script>
<script>hljs.initHighlightingOnLoad();</script>
<h2>Yanzhan's solution for "max array sum"</h2>
<ul>
<li>Hi, I'm Yanzhan. For more algothmic problems, visit my Youtube Channel <a href="https://www.youtube.com/channel/UCDkz-__gl3frqLexukpG0DA?view_as=subscriber" target=_blank>[Yanzhan Yang's Youtube Channel]</a> or my Twitter Account <a href="https://twitter.com/YangYanzhan" target=_blank>[Yanzhan Yang's Twitter]</a> or my GitHub HomePage <a href="https://github.com/yangyanzhan/code-camp" target=_blank>[Yanzhan Yang's GitHub Project]</a> .</li>
<li>It's fascinating to solve algothmic problems, follow Yanzhan to learn more!</li>
</ul>
<div>
</div>
<div>
</div>
<div>
</div>
<h3>
solution:
</h3>
<pre class="yanzhan-hidden"><code class="c++">int maxSubsetSum(vector<int> arr) {
int with_last = arr[0], without_last = 0;
for (int i = 1; i < arr.size(); i++) {
int old_without_last = without_last;
without_last = max(with_last, without_last);
with_last = old_without_last + arr[i];
}
return max(with_last, without_last);
}
</code></pre>
<ul class="yanzhan-hidden">
<li><a href="/index.html" target=_blank>[Go Back To HomePage]</a></li>
<li><a href="/hackerrank" target=_blank>[Go Back To Solution List Page]</a></li>
</ul>
<script src="/main.js"></script>
</body>