leetcode
柏穆
三无大学生,要返厂重修,20160412
展开
-
leetcode经典解法
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. void merge(int* nums1, int m, int* nums2, int n) { int t = m + n - 1; for( ; n > 0转载 2016-06-13 21:54:03 · 389 阅读 · 0 评论 -
leetcode字符串处理经典
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. int romanToInt(char* s) { int length = strlen(s); int i; int a[26]; a['M翻译 2016-06-13 21:57:27 · 648 阅读 · 0 评论