摘要：
1、欧几里德算法（辗转相除法）最大公约数 greatest common divisor，简写为gcd；或highestcommon factor，简写为hcf 最小公倍数 最小公倍数（Least Common Multiple，缩写L.C.M.）最小公倍数=两数的乘积/最大公约数... 阅读全文
摘要：
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of ... 阅读全文