C++
文章平均质量分 77
liyongxin4
这个作者很懒,什么都没留下…
展开
-
Leetcode Maximum Subarray
class Solution { public: int maxSubArray(int A[], int n) { int thisSum = 0; int maxSum = INT_MIN; for(int i = 0; i < n; i++) { if(thisSum < 0) thi原创 2014-04-04 17:48:43 · 373 阅读 · 0 评论 -
Merge Sorted Array
class Solution { public: void merge(int A[], int m, int B[], int n) { if(n == 0) return; if(m == 0) { for(int i = 0; i < n; i++) {原创 2014-04-07 15:23:58 · 452 阅读 · 0 评论 -
Gray Code
关于格雷码的求解主要有两类方法,一类s原创 2014-04-08 09:06:46 · 469 阅读 · 0 评论 -
Remove Duplicates from Sorted List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *de原创 2014-04-08 09:51:19 · 334 阅读 · 0 评论 -
Convert Sorted Array to Binary Search Tree
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti原创 2014-04-08 14:00:42 · 365 阅读 · 0 评论