\u539f\u9898\u94fe\u63a5\uff1ahttps:\/\/leetcode.cn\/contest\/weekly-contest-326<\/p>\n\n\n\n
class Solution {\npublic:\n int countDigits(int num) {\n int t=num, res=0;\n while(num){\n if(t%(num%10) == 0) res++;\n num\/=10;\n }\n \n return res;\n }\n};<\/code><\/pre>\n\n\n\n\u6570\u7ec4\u4e58\u79ef\u4e2d\u7684\u4e0d\u540c\u8d28\u56e0\u6570\u6570\u76ee<\/h3>\n\n\n\n
\u6ce8\u610f\u8fb9\u4e58\u8fb9\u7b5b\u8d28\u56e0\u5b50<\/p>\n\n\n\n
class Solution {\npublic:\n int distinctPrimeFactors(vector<int>& nums) {\n unordered_map<int, int> mp;\n \n for(auto val: nums)\n {\n int n=val;\n for(int i=2; i<=n\/i; i++)\n while(n%i==0) n\/=i, mp[i]++;\n if(n>1) mp[n]++;\n }\n \n return mp.size();\n }\n};<\/code><\/pre>\n\n\n\n\u5c06\u5b57\u7b26\u4e32\u5206\u5272\u6210\u503c\u4e0d\u8d85\u8fc7 K \u7684\u5b50\u5b57\u7b26\u4e32<\/h3>\n\n\n\n
\u8d2a\u5fc3<\/p>\n\n\n\n
class Solution {\npublic:\n int minimumPartition(string s, int k) {\n int res=0, sum=0;\n int n=s.size();\n for(int i=0; i<n; i++){\n int x=s[i]-'0';\n if(x>k) return -1;\n if(x+1ll*sum*10 <= k) sum=sum*10+x;\n else res++, sum=x;\n }\n \n if(sum) res++;\n return res;\n }\n};<\/code><\/pre>\n\n\n\n\u8303\u56f4\u5185\u6700\u63a5\u8fd1\u7684\u4e24\u4e2a\u8d28\u6570<\/h3>\n\n\n\n
\u628a $[1, right]$ \u4e4b\u95f4\u7684\u8d28\u6570\u5168\u90e8\u7b5b\u51fa\u6765\uff0c\u7136\u540e\u5bf9\u6ee1\u8db3\u6761\u4ef6\u7684\u9010\u4e00\u6bd4\u8f83\u3002<\/p>\n\n\n\n
class Solution {\npublic:\n int primes[1000010], cnt;\n bool st[1000010];\n void euler(int n)\n {\n for(int i=2;i<=n;i++)\n {\n if(!st[i]) primes[cnt++]=i;\n for(int j=0;j<cnt&&primes[j]*i<=n;j++)\n {\n st[i*primes[j]]=true;\n if(i%primes[j]==0) break;\n }\n }\n }\n vector<int> closestPrimes(int left, int right) {\n euler(right);\n \n int k=-1, minv=0x3f3f3f3f;\n for(int i=0;i<cnt;i++){\n if(primes[i]>=left && i-1>=0 && primes[i-1]>=left) {\n if(primes[i]-primes[i-1]<minv) {\n k=i, minv=primes[i]-primes[i-1];\n }\n }\n }\n if(minv==0x3f3f3f3f) return {-1, -1};\n\n return {primes[k-1], primes[k]};\n }\n};<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"\u5143\u65e6\u5feb\u4e50\uff01\uff01\uff01 \u539f\u9898\u94fe\u63a5\uff1ahttps:\/\/leetcode.cn\/contest\/weekly-contest […]<\/p>\n","protected":false},"author":1,"featured_media":205,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[9],"tags":[79,37,80,57],"class_list":["post-195","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-leetcode","tag-leetcode","tag-sieve-primes","tag-80","tag-57"],"_links":{"self":[{"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/posts\/195","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/comments?post=195"}],"version-history":[{"count":5,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/posts\/195\/revisions"}],"predecessor-version":[{"id":202,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/posts\/195\/revisions\/202"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/media\/205"}],"wp:attachment":[{"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/media?parent=195"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/categories?post=195"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/tags?post=195"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}