
leetcode
谢符宝
业精于勤,荒于嬉行成于思,毁于随。
展开
-
LeetCode按单词反转字符串
//传入一个字符串引用,按单词翻转字符串class Solution{public: void reverseWords(string &s) { vector vec; string str=""; for(int i=0; i<s.size(); i++) { if(s[i]=='原创 2014-04-22 12:30:39 · 800 阅读 · 0 评论 -
321. Create Maximum Number(贪心)
Create Maximum NumberGiven two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k from digits of the two. The relative order of the dig原创 2015-12-25 19:42:21 · 1437 阅读 · 0 评论