摘要: Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-neg 阅读全文
posted @ 2017-06-20 17:33 王大咩的图书馆 阅读(663) 评论(0) 推荐(0) 编辑
摘要: The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ... 1is read off as"one 1"or11.11is read off as"t 阅读全文
posted @ 2017-06-20 16:31 王大咩的图书馆 阅读(358) 评论(0) 推荐(0) 编辑
摘要: Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 思路:有关罗马数字的相关知识可见博客Integer to roman。从左往右遍历字 阅读全文
posted @ 2017-06-20 15:23 王大咩的图书馆 阅读(330) 评论(0) 推荐(0) 编辑
摘要: Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 题意:将整数转换成罗马数字,这里就需要对什么是罗马数字有一些了解。一下部分摘选于百度 阅读全文
posted @ 2017-06-20 10:52 王大咩的图书馆 阅读(490) 评论(0) 推荐(1) 编辑