Sunshine

You may need to read in http://google-styleguide.googlecode.com/svn/trunk/cppguide.xml。

path-sum递归：如果使用递归，需要明确递归的结束条件，结束条件分为几类。递归的模式为：Type f(...) {    if 满足结束条件1        return x;    if 满足结束条件2        return x;    ......        递归表达式}

题目Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it wit

//空间O(n), 时间O(nlogn)class Solution {public: int singleNumber(int A[], int n) { set se; for (int i = 0; i < n; ++i) { auto it = se.find(A[i]); if (it == s

题目分析复杂度CODE

题目分析复杂度CODE

题目分析复杂度CODE

CODE见  http://blog.csdn.net/staibin/article/details/37932173  中的后序遍历。

1、先序2、中序3、后序

题目分析复杂度输入CODE/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL)

题目分析复杂度注意输入

题目CODE/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ typede

CODE：Cyuyan#include #include #include typedef int ElemType;typedef struct _ListNode{ ElemType data; struct ListNode* next;}ListNode;ListNode * initSList();int isEmpty(ListNode *hea

参考文章：http://blog.csdn.net/challenge_c_plusplus/article/details/7429963#include #include #include #include using namespace std;bool my_compare(const string &str1, const string &str2){ retu

题目分析

原文链接： http://blog.csdn.net/ztz0223/article/details/1628669

题目Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2

题目分析时间复杂度输入ji

题目分析输入shi