"leetcode" 202. Happy number
Last Update:2015-07-26
Source: Internet
Author: User
<span id="Label3"></p><pre class="prettyprint"><code class="language-C++ hljs java"><span class="hljs-annotation"><span class="hljs-annotation">@requires</span></span>_authorization<span class="hljs-annotation"><span class="hljs-annotation">@author</span></span>Johnsondu<span class="hljs-annotation"><span class="hljs-annotation">@create</span></span>_time<span class="hljs-number"><span class="hljs-number">2015.7</span></span><span class="hljs-number"><span class="hljs-number">.</span> the</span> <span class="hljs-number"><span class="hljs-number">9</span></span>:<span class="hljs-number"><span class="hljs-number"></span> -</span><span class="hljs-annotation"><span class="hljs-annotation">@url</span></span>[Happy number] (https:<span class="hljs-comment"><span class="hljs-comment">//leetcode.com/problems/happy-number/)</span></span><span class="hljs-javadoc"><span class="hljs-javadoc">/************************ *<span class="hljs-javadoctag"> @description</span>: Simple. *<span class="hljs-javadoctag"> @time</span>_complexity:o (n) *<span class="hljs-javadoctag"> @space </span>_complexity:o (n) ************************/</span></span>Class Solution {<span class="hljs-keyword"><span class="hljs-keyword"></span> public</span>: bool<span class="hljs-title"><span class="hljs-title">Ishappy</span></span>(<span class="hljs-keyword"><span class="hljs-keyword">int</span></span>N) {bool flag =<span class="hljs-keyword"><span class="hljs-keyword">false</span></span>; map<<span class="hljs-keyword"><span class="hljs-keyword">int</span></span>,<span class="hljs-keyword"><span class="hljs-keyword">int</span></span>> mp; mp[n] =<span class="hljs-keyword"><span class="hljs-keyword">true</span></span>;<span class="hljs-keyword"><span class="hljs-keyword"></span> while</span>(<span class="hljs-number"><span class="hljs-number">1</span></span>) {<span class="hljs-keyword"><span class="hljs-keyword">int</span></span>Cur =<span class="hljs-number"><span class="hljs-number">0</span></span>;<span class="hljs-keyword"><span class="hljs-keyword"></span> while</span>(n) {cur + = (n%<span class="hljs-number"><span class="hljs-number">Ten</span></span>) * (n%<span class="hljs-number"><span class="hljs-number">Ten</span></span>); n = n/<span class="hljs-number"><span class="hljs-number">Ten</span></span>; }<span class="hljs-keyword"><span class="hljs-keyword">if</span></span>(cur = =<span class="hljs-number"><span class="hljs-number">1</span></span>) {flag =<span class="hljs-keyword"><span class="hljs-keyword">true</span></span>;<span class="hljs-keyword"><span class="hljs-keyword"></span> break</span>; }<span class="hljs-keyword"><span class="hljs-keyword">if</span></span>(mp[cur])<span class="hljs-keyword"><span class="hljs-keyword"></span> break</span>; mp[cur] =<span class="hljs-keyword"><span class="hljs-keyword">true</span></span>; n = cur; }<span class="hljs-keyword"><span class="hljs-keyword">return</span></span>Flag }};</code></pre> <p style="font-size:12px;"><p style="font-size:12px;">Copyright Notice: This article for Bo Master original article, without Bo Master permission not Reproduced.</p></p> <p><p> "leetcode" 202. Happy number </p></p></span>