https://discopal.ispras.ru/index.php?title=%D0%A1%D0%BB%D1%83%D0%B6%D0%B5%D0%B1%D0%BD%D0%B0%D1%8F:%D0%9D%D0%BE%D0%B2%D1%8B%D0%B5_%D1%81%D1%82%D1%80%D0%B0%D0%BD%D0%B8%D1%86%D1%8B&feed=atom&
DISCOPAL - Новые страницы [ru]
2024-03-28T11:08:47Z
Материал из DISCOPAL
MediaWiki 1.26.4
https://discopal.ispras.ru/Mishaglik/Solutions/Leetcode/largest-element-in-an-array-after-merge-operations
Mishaglik/Solutions/Leetcode/largest-element-in-an-array-after-merge-operations
2024-03-04T13:20:05Z
<p>StasFomin: </p>
<hr />
<div><ul><li> <a href="/Leetcode/largest-element-in-an-array-after-merge-operations" title="Leetcode/largest-element-in-an-array-after-merge-operations">Leetcode/largest-element-in-an-array-after-merge-operations</a></li></ul>
<div dir="ltr" class="mw-geshi mw-code mw-content-ltr"><div class="python source-python"><pre class="de1"><span class="kw1">class</span> Solution:
<span class="kw1">def</span> maxArrayValue<span class="br0">(</span><span class="kw2">self</span><span class="sy0">,</span> nums: List<span class="br0">[</span><span class="kw2">int</span><span class="br0">]</span><span class="br0">)</span> -<span class="sy0">></span> <span class="kw2">int</span>:
nums.<span class="me1">reverse</span><span class="br0">(</span><span class="br0">)</span>
<span class="kw2">sum</span> <span class="sy0">=</span> <span class="nu0">0</span>
ans <span class="sy0">=</span> <span class="nu0">0</span>
<span class="kw1">for</span> x <span class="kw1">in</span> nums:
<span class="kw1">if</span> <span class="kw2">sum</span> <span class="sy0">==</span> <span class="nu0">0</span>:
<span class="kw2">sum</span> <span class="sy0">=</span> x
<span class="kw1">continue</span>
 
<span class="kw1">if</span> x <span class="sy0"><=</span> <span class="kw2">sum</span>:
<span class="kw2">sum</span> +<span class="sy0">=</span> x
<span class="kw1">else</span>:
ans <span class="sy0">=</span> <span class="kw2">max</span><span class="br0">(</span>ans<span class="sy0">,</span> <span class="kw2">sum</span><span class="br0">)</span>
<span class="kw2">sum</span> <span class="sy0">=</span> x
<span class="kw1">return</span> <span class="kw2">max</span><span class="br0">(</span>ans<span class="sy0">,</span> <span class="kw2">sum</span><span class="br0">)</span></pre></div></div>
<p><a href="/%D0%A3%D1%87%D0%B0%D1%81%D1%82%D0%BD%D0%B8%D0%BA:StasFomin" title="Участник:StasFomin">StasFomin</a> 14:34, 7 марта 2024 (UTC): <a rel="nofollow" class="external text" href="https://leetcode.com/problems/largest-element-in-an-array-after-merge-operations/submissions/1196761419/">OK</a>
</p></div>
Mishaglik