<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	
	xmlns:georss="http://www.georss.org/georss"
	xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#"
	>

<channel>
	<title>plusone &#8211; JSAlgorithm</title>
	<atom:link href="https://jsalgorithm.com/tag/plusone/feed/" rel="self" type="application/rss+xml" />
	<link>https://jsalgorithm.com</link>
	<description></description>
	<lastBuildDate>Wed, 20 May 2020 17:34:14 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.5.15</generator>
<site xmlns="com-wordpress:feed-additions:1">177240629</site>	<item>
		<title>Array Plus One</title>
		<link>https://jsalgorithm.com/2020/05/20/array-plus-one/</link>
					<comments>https://jsalgorithm.com/2020/05/20/array-plus-one/#respond</comments>
		
		<dc:creator><![CDATA[Ronald]]></dc:creator>
		<pubDate>Wed, 20 May 2020 17:34:14 +0000</pubDate>
				<category><![CDATA[Array]]></category>
		<category><![CDATA[Leetcode]]></category>
		<category><![CDATA[array]]></category>
		<category><![CDATA[leetcode]]></category>
		<category><![CDATA[plusone]]></category>
		<guid isPermaLink="false">http://50.19.13.106/?p=128</guid>

					<description><![CDATA[let plusOne = function(digits) { let carry = 1; for (let i = digits.length - 1; i &#62;= 0; i--) { let sum = digits[i] + carry; if (sum &#62;= 10) { digits[i] = 0; carry = 1; } else { digits[i] = sum; carry = 0; } } if (carry === 1) digits.unshift(carry); return [&#8230;]]]></description>
										<content:encoded><![CDATA[
<pre class="wp-block-preformatted">let plusOne = function(digits) {<br><br>    let carry = 1;<br>    for (let i = digits.length - 1; i &gt;= 0; i--) {<br>        let sum = digits[i] + carry;<br>        if (sum &gt;= 10) {<br>            digits[i] = 0;<br>            carry = 1;<br>        }<br>        else {<br>            digits[i] = sum;<br>            carry = 0;<br>        }<br>    }<br><br>    if (carry === 1) digits.unshift(carry);<br><br>    return digits;<br>};</pre>
]]></content:encoded>
					
					<wfw:commentRss>https://jsalgorithm.com/2020/05/20/array-plus-one/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">128</post-id>	</item>
	</channel>
</rss>
