{"id":513,"date":"2013-10-07T17:03:37","date_gmt":"2013-10-07T09:03:37","guid":{"rendered":"http:\/\/hymike.net\/blog\/?p=513"},"modified":"2013-10-07T17:03:37","modified_gmt":"2013-10-07T09:03:37","slug":"test-for-code","status":"publish","type":"post","link":"https:\/\/blog.hymike.net\/?p=513","title":{"rendered":"test for code"},"content":{"rendered":"


\nclass Solution {
\npublic:
\n struct info
\n {
\n int id;
\n int step;
\n };
\n void gen(vector &vstr,vector *c, int id,vector> &res)
\n {
\n vector v;
\n vector> tres;
\n if(c[id].size()==0)
\n {
\n v.push_back(vstr[id]);
\n res.push_back(v);
\n return;
\n }
\n int i,j;
\n for(i=0;i> findLadders(string start, string end, unordered_set &dict) {
\n \/\/ Start typing your C\/C++ solution below
\n \/\/ DO NOT write int main() function
\n vector> res;
\n vector v;
\n if(start==end) \/\/start is end
\n {
\n v.push_back(start);
\n res.push_back(v);
\n return res;
\n }
\n unordered_map mp;
\n unordered_map::iterator iter_m;
\n unordered_set::iterator iter_s;
\n vector vstr;
\n dict.insert(start);
\n dict.insert(end);
\n int id=0,i,j,k;
\n for(iter_s=dict.begin();iter_s!=dict.end();++iter_s)
\n {
\n vstr.push_back(*iter_s);
\n mp.insert(make_pair(*iter_s,id));
\n id++;
\n }
\n int nStart, nEnd;
\n iter_m = mp.find(start);
\n nStart = iter_m->second;
\n iter_m = mp.find(end);
\n nEnd = iter_m->second;<\/p>\n

int len = start.length();
\n int nTotal = mp.size();
\n vector *c = new vector [nTotal];
\n int *step = new int [nTotal];
\n for(i=0;i q;
\n q.push(temp);
\n while(!q.empty())
\n {
\n cur=q.front();
\n q.pop();
\n if(cur.step>=nMin) continue;
\n string str = vstr[cur.id];
\n for(i=0;isecond;
\n if(step[id]<=cur.step) continue;\n if(step[id]!=cur.step+1)\n {\n temp.id=id;\n temp.step=cur.step+1;\n q.push(temp);\n step[id]=cur.step+1;\n if(id==nEnd) nMin = cur.step+1; \/\/find end\n }\n c[id].push_back(cur.id);\n }\n }\n }\n if(c[nEnd].size()==0) \/\/no result\n {\n delete[]c;\n delete[]step;\n return res; \n }\n gen(vstr,c,nEnd,res);\n delete[]c;\n delete[]step;\n return res;\n }\n};\n<\/code><\/p>\n","protected":false},"excerpt":{"rendered":"

class Solution { public: struct info { int id; int step … \u7ee7\u7eed\u9605\u8bfb\u201ctest for code\u201d<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[4],"tags":[],"_links":{"self":[{"href":"https:\/\/blog.hymike.net\/index.php?rest_route=\/wp\/v2\/posts\/513"}],"collection":[{"href":"https:\/\/blog.hymike.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.hymike.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.hymike.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.hymike.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=513"}],"version-history":[{"count":0,"href":"https:\/\/blog.hymike.net\/index.php?rest_route=\/wp\/v2\/posts\/513\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.hymike.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=513"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.hymike.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=513"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.hymike.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=513"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}