wjk20120522的专栏

class Solution {public: int climbStairs(int n) { int firster = 1; int seconder = 2; if(1 == n) { return 1; } else if(2 == n) { return 2; } int i,resul

题目：https://oj.leetcode.com/problems/string-to-integer-atoi/代码：class Solution {public: int atoi(const char *str) { if (str == NULL) return 0; long long int res = 0, i; bool neg

题目： https://oj.leetcode.com/problems/zigzag-conversion/ https://oj.leetcode.com/problems/zigzag-conversion/需要找到每行各种字符对应在源字符的位置，即找出两者之间的规律。这题就比较好解了。代码：class Solution {public: string

题目： https://oj.leetcode.com/problems/search-a-2d-matrix/思路： 从二维数组的左上角

题目地址： https://oj.leetcode.com/problems/sort-colors/

参考别人写的代码， 代码很赞

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

class Solution {public: int evalRPN(vector &tokens) { vector::iterator it; vector temp; int result = 0; if( 0 == tokens.size() ) { return 0; } while(true) {

class Solution {public: void merge(int A[], int m, int B[], int n) { // use STL function copy( B, B + n, A + m); sort(A, A + m + n); /** another concrete method *********

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti

#include #include #include #include #include #include using namespace std;struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}}

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti

class Solution {public: int minDistance(string word1, string word2) { int len1 = word1.length(), len2 = word2.length(); if(len1 == 0) return len2; //if word1 is empty if(len2 == 0)

题目： https://oj.leetcode.com/problems/4sum/代码：对于这类问题首先需要将数组进行整体排序。然后比较某两个数是否存在和target-这两个数和 相等的两个数。值得注意的是，要考虑到重复的情况，所以需要用set之类作区分。class Solution {public: vector > fourSum(vector &n