fendoubasaonian的专栏

1、wiki：Roman数字介绍 https://en.wikipedia.org/wiki/Roman_numerals2、 Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 3、 Combination Value IV 4 IX 9 XL 40 X

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *mer

1、要求 Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one di

1.需求 Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”.2.代码#include <iostream> #include <string>using namespace std;class Solution { publi

1.要求 Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn’t matter what you leave beyond the new length.2.