leetcode
文章平均质量分 61
liyongxin4
这个作者很懒,什么都没留下…
展开
-
Merge Two Sorted Lists
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *mergeTwoLists(ListNode *l1,原创 2014-04-04 15:24:22 · 363 阅读 · 0 评论 -
Set Matrix Zeroes
class Solution {public: void setZeroes(vector > &matrix) { int rows = matrix.size(); if(rows == 0) return; int cols = matrix[0].size(); vector rowLabel(row原创 2014-04-10 14:56:58 · 458 阅读 · 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 · 367 阅读 · 0 评论 -
Partition List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *pa原创 2014-04-10 10:23:11 · 497 阅读 · 0 评论 -
Pow(x, n)
class Solution {public: double pow(double x, int n) { if(n == 0) return 1; if(n < 0) { if(isEven(n)) return pow(x * x, n/2); el原创 2014-04-09 10:02:16 · 318 阅读 · 0 评论 -
Climbing Stairs
class Solution {public: int climbStairs(int n) { if(n == 0) return 0; if(n == 1) return 1; if(n == 2) return 2; return climbStairs(n - 1) +原创 2014-04-08 22:44:43 · 384 阅读 · 0 评论 -
Swap Nodes in Pairs
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *sw原创 2014-04-08 20:32:14 · 336 阅读 · 0 评论 -
Search a 2D Matrix
class Solution {public: bool searchMatrix(vector > &matrix, int target) { int rowNum = insertPosition(matrix, target); if(rowNum == -1) return true; else r原创 2014-04-09 16:49:08 · 600 阅读 · 0 评论 -
Balanced Binary 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-09 15:51:33 · 398 阅读 · 0 评论 -
Rotate Image
class Solution {public: void rotate(vector > &matrix) { int n = matrix.size(); vector > newMatrix(n, vector(n, 1)); for(int i = 0; i < n; i++) { for(in原创 2014-04-08 22:16:16 · 452 阅读 · 0 评论 -
Unique Paths
class Solution {public: int uniquePaths(int m, int n) { if(m == 0 || n == 0) return 0; if(m == 1 || n == 1) return 1; return uniquePaths(m - 1, n) + unique原创 2014-04-08 17:09:09 · 375 阅读 · 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 · 340 阅读 · 0 评论 -
Gray Code
关于格雷码的求解主要有两类方法,一类s原创 2014-04-08 09:06:46 · 480 阅读 · 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 · 454 阅读 · 0 评论 -
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 · 375 阅读 · 0 评论 -
Remove Duplicates from Sorted Array
题目明确指出了对空间复杂度的限制,而且还隐含了对时间复杂度的限制。原创 2014-04-10 15:44:16 · 353 阅读 · 0 评论