{"id":845,"date":"2017-11-19T08:13:34","date_gmt":"2017-11-19T16:13:34","guid":{"rendered":"http:\/\/zxi.mytechroad.com\/blog\/?p=845"},"modified":"2018-04-19T08:32:13","modified_gmt":"2018-04-19T15:32:13","slug":"leetcode-728-self-dividing-numbers","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/math\/leetcode-728-self-dividing-numbers\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 728. Self Dividing Numbers"},"content":{"rendered":"<p><iframe loading=\"lazy\" title=\"\u82b1\u82b1\u9171 LeetCode 728. Self Dividing Numbers  - \u5237\u9898\u627e\u5de5\u4f5c EP111\" width=\"500\" height=\"375\" src=\"https:\/\/www.youtube.com\/embed\/Px8TABDC7ag?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" referrerpolicy=\"strict-origin-when-cross-origin\" allowfullscreen><\/iframe><\/p>\n<p><strong>Problem:<\/strong><\/p>\n<p>A\u00a0<i>self-dividing number<\/i>\u00a0is a number that is divisible by every digit it contains.<\/p>\n<p>For example, 128 is a self-dividing number because\u00a0<code>128 % 1 == 0<\/code>,\u00a0<code>128 % 2 == 0<\/code>, and\u00a0<code>128 % 8 == 0<\/code>.<\/p>\n<p>Also, a self-dividing number is not allowed to contain the digit zero.<\/p>\n<p>Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.<\/p>\n<p><b>Example 1:<\/b><\/p>\n<pre class=\"\">Input: \r\nleft = 1, right = 22\r\nOutput: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]\r\n<\/pre>\n<p><b>Note:<\/b><\/p>\n<ul>\n<li>The boundaries of each input argument are\u00a0<code>1 &lt;= left &lt;= right &lt;= 10000<\/code>.<\/li>\n<\/ul>\n<p><script async src=\"\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js\"><\/script><br \/>\n<ins class=\"adsbygoogle\" style=\"display: block; text-align: center;\" data-ad-layout=\"in-article\" data-ad-format=\"fluid\" data-ad-client=\"ca-pub-2404451723245401\" data-ad-slot=\"7983117522\"><\/ins><br \/>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script><br \/>\n<strong>Idea:<\/strong><\/p>\n<p><a href=\"http:\/\/zxi.mytechroad.com\/blog\/wp-content\/uploads\/2017\/11\/728-ep111-1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-851\" src=\"http:\/\/zxi.mytechroad.com\/blog\/wp-content\/uploads\/2017\/11\/728-ep111-1.png\" alt=\"\" width=\"960\" height=\"540\" srcset=\"https:\/\/zxi.mytechroad.com\/blog\/wp-content\/uploads\/2017\/11\/728-ep111-1.png 960w, https:\/\/zxi.mytechroad.com\/blog\/wp-content\/uploads\/2017\/11\/728-ep111-1-300x169.png 300w, https:\/\/zxi.mytechroad.com\/blog\/wp-content\/uploads\/2017\/11\/728-ep111-1-768x432.png 768w, https:\/\/zxi.mytechroad.com\/blog\/wp-content\/uploads\/2017\/11\/728-ep111-1-624x351.png 624w\" sizes=\"auto, (max-width: 960px) 100vw, 960px\" \/><\/a><\/p>\n<p>Brute Force<\/p>\n<p>Time Complexity: O(n)<\/p>\n<p>Space Complexity: O(1)<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Solution:<\/strong><\/p>\n<p>C++<\/p>\n<pre class=\"lang:c++ decode:true \">\/\/ Author: Huahua\r\n\/\/ Runtime: 3 ms\r\nclass Solution {\r\npublic:\r\n    vector&lt;int&gt; selfDividingNumbers(int left, int right) {\r\n        vector&lt;int&gt; ans;\r\n        for (int n = left; n &lt;= right; ++n) {\r\n            int t = n;\r\n            bool valid = true;\r\n            while (t &amp;&amp; valid) {\r\n                const int r = t % 10;\r\n                if (r == 0 || n % r)\r\n                    valid = false;\r\n                t \/= 10;\r\n            }\r\n            if (valid) ans.push_back(n);\r\n        }\r\n        return ans;\r\n    }\r\n};<\/pre>\n<p>String<\/p>\n<pre class=\"lang:c++ decode:true \">\/\/ Author: Huahua\r\n\/\/ Runtime: 6 ms\r\nclass Solution {\r\npublic:\r\n    vector&lt;int&gt; selfDividingNumbers(int left, int right) {\r\n        vector&lt;int&gt; ans;\r\n        for (int n = left; n &lt;= right; ++n) {\r\n            const string t = std::to_string(n);\r\n            bool valid = true;\r\n            for (const char c : t) {\r\n                if (c == '0' || n % (c - '0')) {\r\n                    valid = false;\r\n                    break;\r\n                }\r\n            }\r\n            if (valid) ans.push_back(n);\r\n        }\r\n        return ans;\r\n    }\r\n};<\/pre>\n<p>&nbsp;<\/p>\n<p><strong>Related Problems:<\/strong><\/p>\n<ul>\n<li><a href=\"http:\/\/zxi.mytechroad.com\/blog\/math\/leetcode-611-valid-triangle-number\/\">[\u89e3\u9898\u62a5\u544a] LeetCode 611. Valid Triangle Number<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Problem: A\u00a0self-dividing number\u00a0is a number that is divisible by every digit it contains. For example, 128 is a self-dividing number because\u00a0128 % 1 == 0,\u00a0128&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[163,49],"tags":[157,158,156],"class_list":["post-845","post","type-post","status-publish","format-standard","hentry","category-easy","category-math","tag-digit","tag-mod","tag-reminder","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/845","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=845"}],"version-history":[{"count":8,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/845\/revisions"}],"predecessor-version":[{"id":2584,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/845\/revisions\/2584"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=845"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=845"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=845"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}