Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that only one letter can be changed at a time and each intermediate word must exist in the dictionary
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002184s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.091463s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002371s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002263s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002515s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003853s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002020s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003399s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015284s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002440s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 56234 [ RunTime:0.001194s ]
