摘要：
题目在这里 pub fn prefix_matches(prefix: &str, request_path: &str) -> bool { //split by slash and change element into Option and add None at the end. let m 阅读全文
摘要：
什么是Luhn算法？ pub fn luhn(cc_number: &str) -> bool { //scan number from right to left, the digit *2 which in every second position if cc_number.is_empty( 阅读全文