cyclone

#include<iostream> #include<string> #include<vector> using namespace std; class Solution { public: int uniqueMorseRepresentations(vector<string>& words) { string s[26]...

#include<iostream> #include<string> #include<vector> #include<algorithm> using namespace std; class Solution { public: int maxIncreaseKeepingSkyline(vector<vector<in...

class Solution { public: int maxArea(vector<int>& height) { int left = 0; int right = height.size()-1; int maxValue = 0; while(left<right){ ...

class Solution { public: ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) { ListNode preHead(0), *p = &preHead; int carry = 0; while (l1 || l2 || carry) { int sum = (l1 ? l1...

class Solution { public: int myAtoi(string str) { int i = 0, base = 0, sign = 1; while (str[i] == ' '&&i<str.size()) { i++; } if (str[i] == '-' || str[i] == '+') { str[i]...

转自：点击打开链接class Solution { public: bool isMatch(string s, string p) { if (p.empty()) return s.empty(); if (p.size() > 1 && p[1] == '*') { return isMatch(s, p....

class Solution { public: int maxArea(vector<int>& height) { int i,a=0,b=height.size()-1,volumn=0; for (i = 0; a<b && i<height.size(); i++) { int minValue = min(he...

用了最笨的办法，遍历一次取出所有元素排序，生成新链表，没想到通过了~/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class ...