2015年11月_cookcoder

11月 10月

原创 Reverse Words in a String

#include#include#include#include#include#includeusing namespace std;class Solution {public:string reverseWords(string str) {if (str == "")return str;else {int i = 0;int j

2015-11-17 21:53:36 360

原创 strStr()

#include#include#include#includeusing namespace std; //从按行的角度出发，计算逐个需要存的字符的对应原串的下标。class Solution {public: int strStr(string haystack,string needle) { int i,j; // cout << needle.size(

2015-11-17 19:28:37 275

原创 Reverse Interger

#include#include#include#includeusing namespace std; //从按行的角度出发，计算逐个需要存的字符的对应原串的下标。class Solution {public: int reverse(int x) { if(x==0) return x; int bit

2015-11-08 13:17:32 303

原创 ZigZag Convertion

#include#include#include#includeusing namespace std; //从按行的角度出发，计算逐个需要存的字符的对应原串的下标。class Solution {public:Za string convert(string s, int numRows) {string re= "";int len =s.size

2015-11-06 21:53:07 315

原创 TwoSum

#include#include#include#includeusing namespace std;//先对原始数组进行排序，建立一个新的Id vector存储各个元素排序之前的序号，//对小于target的部分用for循环判断是否为twosum和class Solution {public: vector twoSum(vector& nums, i

2015-11-06 19:44:45 426 1

原创 word pattern

class Solution {public: bool wordPattern(string pattern, string str) { int p_len =pattern.size(); vector word ; int t=0; for(int i=0;i<str.size();i++) if (str[i]==' '){ string ww=s

2015-11-03 22:13:40 346

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人