{"id":2311,"date":"2016-10-27T15:38:53","date_gmt":"2016-10-27T07:38:53","guid":{"rendered":"http:\/\/boweihe.me\/?p=2311"},"modified":"2016-10-27T15:38:53","modified_gmt":"2016-10-27T07:38:53","slug":"leetcode-368-largest-divisible-subset","status":"publish","type":"post","link":"https:\/\/dayandcarrot.space\/?p=2311","title":{"rendered":"LeetCode 368. Largest Divisible Subset"},"content":{"rendered":"<p>\u601d\u8def\uff1a<br \/>\n\u60f3\u5230\u4e00\u4e2a\u8bcd\u53eb\u201c\u4f20\u9012\u6027\u201d\uff0c\u5728\u8fd9\u8fb9\u5e94\u8be5\u4e5f\u9002\u7528\u3002\u5c31\u662f\u5982\u679cb%a==0\uff0c\u7136\u540ec%b==0\uff0c\u90a3\u4e48\u80af\u5b9a\u6709c%a==0. \u6309\u7167\u8fd9\u4e2a\u65b9\u6cd5\u6765\u6784\u9020\u4e00\u4e2a\u96c6\u5408\u5c31\u53ef\u4ee5\u4e86\uff0c\u5e94\u8be5\u662f\u52a8\u6001\u89c4\u5212\u7684\u601d\u60f3\uff0cresults[i]\u4fdd\u5b58\u5305\u542b\u6570\u7ec4\u5143\u7d20nums[i]\u7684\u6700\u4f73\u96c6\u5408\uff0c\u6784\u5efa\u96c6\u5408\u7684\u65f6\u5019\uff0c\u9996\u5148\u4ece\u4e4b\u524d\u7684results[j] (j=0&#8230;i-1)\u91cc\u9762\u627e\u5230\u80fd\u591f\u201c\u4f20\u9012\u201d\u8fc7\u6765\u7684\u96c6\u5408(nums[i]%nums[i]==0)\u9009\u4f5c\u6700\u4f73\uff08\u76f8\u5f53\u4e8e\u627e\u5230c%b==0\uff0c\u5f53\u7136\u8fd9\u91cc\u7684b\u662f\u4e4b\u524dresults[j]\u91cc\u9762\u7684\u6700\u5927\u5143\u7d20\uff0c\u5373nums[j]\uff09\u7136\u540e\u52a0\u4e0a\u672c\u8eab\u7684nums[i]\u5c31\u6784\u6210\u4e86\u5230\u7b2ci\u4e2a\u5143\u7d20\u4e3a\u6b62\u7684\u6700\u4f73\u96c6\u5408\uff0c\u5982\u6b64\u7ee7\u7eed&#8230;<br \/>\n\u65f6\u95f4\u590d\u6742\u5ea6\u5e94\u8be5\u662fO(n^2)<\/p>\n<pre class=\"lang:c++ decode:true \">class Solution {\npublic:\n    vector&lt;int&gt; largestDivisibleSubset(vector&lt;int&gt;&amp; nums) {\n        if(nums.empty())\n            return nums;\n        sort(nums.begin(), nums.end());\n        int bestIndex = 0;\n        vector&lt;vector&lt;int&gt;&gt; results(nums.size());\n        for(int i=0; i&lt;nums.size(); i++){\n            for(int j=0; j&lt;i; j++){\n                \/\/nums[j] &lt; nums[i]\n                if(nums[i]%nums[j]==0 &amp;&amp;\n                    results[i].size() &lt; results[j].size())\n                    results[i] = results[j];\n            }\n            results[i].push_back(nums[i]);\n            if(results[bestIndex].size() &lt; results[i].size())\n                bestIndex = i;\n        }\n        return results[bestIndex];\n    }\n};<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u601d\u8def\uff1a \u60f3\u5230\u4e00\u4e2a\u8bcd\u53eb\u201c\u4f20\u9012\u6027\u201d\uff0c\u5728\u8fd9\u8fb9\u5e94\u8be5\u4e5f\u9002\u7528\u3002\u5c31\u662f\u5982\u679cb%a==0\uff0c\u7136\u540ec%b==0\uff0c\u90a3\u4e48\u80af\u5b9a\u6709c%a==0. \u6309\u7167\u8fd9\u4e2a\u65b9\u6cd5\u6765\u6784\u9020\u4e00\u4e2a\u96c6\u5408\u5c31\u53ef\u4ee5\u4e86\uff0c\u5e94\u8be5\u662f\u52a8\u6001\u89c4\u5212\u7684\u601d\u60f3\uff0cresults[i]\u4fdd\u5b58\u5305\u542b\u6570\u7ec4\u5143\u7d20nums[i]\u7684\u6700\u4f73\u96c6\u5408\uff0c\u6784\u5efa\u96c6\u5408\u7684\u65f6\u5019\uff0c\u9996\u5148\u4ece\u4e4b\u524d\u7684results[j] (j=0&#8230;i-1)\u91cc\u9762\u627e\u5230\u80fd\u591f\u201c\u4f20\u9012\u201d\u8fc7\u6765\u7684\u96c6\u5408(nums[i]%nums[i]==0)\u9009\u4f5c\u6700\u4f73\uff08\u76f8\u5f53\u4e8e\u627e\u5230c%b==0\uff0c\u5f53\u7136\u8fd9\u91cc\u7684b\u662f\u4e4b\u524dresults[j]\u91cc\u9762\u7684\u6700\u5927\u5143\u7d20\uff0c\u5373nums[j]\uff09\u7136\u540e\u52a0\u4e0a\u672c\u8eab\u7684nums[i]\u5c31\u6784\u6210\u4e86\u5230\u7b2ci\u4e2a\u5143\u7d20\u4e3a\u6b62\u7684\u6700\u4f73\u96c6\u5408\uff0c\u5982\u6b64\u7ee7\u7eed&#8230; \u65f6\u95f4\u590d\u6742\u5ea6\u5e94\u8be5\u662fO(n^2) class Solution { public: vector&lt;int&gt; largestDivisibleSubset(vector&lt;int&gt;&amp; nums) { if(nums.empty()) return nums; sort(nums.begin(), nums.end()); int bestIndex = 0; vector&lt;vector&lt;int&gt;&gt; results(nums.size()); for(int i=0; i&lt;nums.size(); i++){ for(int j=0; j&lt;i; j++){ \/\/nums[j] &lt; nums[i] if(nums[i]%nums[j]==0 &amp;&amp; results[i].size() &lt; results[j].size()) results[i] = results[j]; } results[i].push_back(nums[i]); if(results[bestIndex].size() &lt; results[i].size()) bestIndex = i; } return results[bestIndex]; } [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4],"tags":[66,141],"class_list":["post-2311","post","type-post","status-publish","format-standard","hentry","category-study","tag-leetcode-oj","tag-141"],"_links":{"self":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/2311","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2311"}],"version-history":[{"count":0,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/2311\/revisions"}],"wp:attachment":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2311"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2311"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2311"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}