LeetCode
文章平均质量分 71
xuxumoi
笑点低的程序媛一枚
展开
-
[leetcode] Summary Ranges
class Solution {public: string GetStr(vector& nums, int start, int end) { char c[100]; if(start == end) sprintf(c, "%d", nums[start]); else sp原创 2015-06-29 18:07:32 · 256 阅读 · 0 评论 -
[leetcode] Valid Parentheses
class Solution {public: int GetScore(char c) { if(c == '(') return 1; if(c == '{') return 2; if(c == '[') return 3; if(c ==原创 2015-06-29 18:25:52 · 335 阅读 · 0 评论 -
[leetcode] Valid Palindrome
class Solution {public: static bool equal(char c1, char c2) { if(c1 == c2) return true; if(c1 > c2) return (c1 -32 == c2); return (c1+32 == c2)原创 2015-06-29 18:43:54 · 287 阅读 · 0 评论 -
[LeetCode] Isomorphic Strings
Isomorphic Strings :题目链接重点:hash_tablemap方式(时间52ms):class Solution {public: bool isIsomorphic(string s, string t) { map flag; map bmatch; int i; for(原创 2015-06-28 10:45:48 · 536 阅读 · 0 评论 -
[leetcode] Palindrome Number
class Solution {public: bool isPalindrome(int x) { if(x < 0) return false; int x1 = x; int y = 0; while(x1 != 0) { y *= 10原创 2015-06-29 18:13:43 · 213 阅读 · 0 评论 -
[leetcode] Happy Number
class Solution {public: int GetNext(int n) { int t = 0; while(n != 0) { t += (n%10)*(n%10); n = n / 10; } return t; } b原创 2015-06-29 20:10:55 · 223 阅读 · 0 评论 -
[leetcode] Roman to Integer
class Solution {public: int GetScore(char c) { if(c =='I') return 1; if(c == 'V') return 5; if(c == 'X') return 10; if(c =原创 2015-06-29 17:33:06 · 252 阅读 · 0 评论 -
[LeetCode]Rectangle Area
class Solution {public: int InterLength(int a1, int a2, int b1, int b2) { if(b1 >= a1 && b1 <= a2) { return min(b2, a2) - b1; } else if(b2 >= a1 &原创 2015-06-29 17:29:47 · 317 阅读 · 0 评论 -
[leetcode] Length of Last Word
class Solution {public: int lengthOfLastWord(string s) { int len = 0; bool flag = false; for(int i = s.size()-1;i>=0;i--) { if(s[i] == ' ' &&原创 2015-06-29 18:52:04 · 247 阅读 · 0 评论 -
[leetcode] Valid Sudoku
class Solution {public: const int LEN = 9; bool isValidSudoku(vector>& board) { //check rows & cols for(int j =0;j<LEN;j++) { bool check[LEN+1] = {false};原创 2015-06-29 19:34:53 · 251 阅读 · 0 评论 -
[leetcode] Remove Duplicates from Sorted Array
class Solution {public: int removeDuplicates(vector& nums) { if(nums.size() == 0) return 0; int start = 0; for(int i = 1;i<nums.size();i+原创 2015-06-29 19:45:08 · 252 阅读 · 0 评论 -
LeetCode || Sort Colors
class Solution {public: void sortColors(vector& nums) { int CountNum[3] ={0}; for(int i = 0;i<nums.size();i++) { CountNum[nums[i]]++; }原创 2015-06-30 09:22:17 · 324 阅读 · 0 评论 -
LeetCode || Merge Sorted Array
class Solution {public: void merge(vector& nums1, int m, vector& nums2, int n) { vector nums3; /* for(int i = m;i<m+n;i++) nums1[i] = nums2[i-m]; sort(原创 2015-06-30 09:36:35 · 238 阅读 · 0 评论 -
LeetCode || Submission Details
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* re原创 2015-06-30 19:06:07 · 606 阅读 · 0 评论 -
LeetCode || Min Stack
class MinStack {public: void push(int x) { sta.push(x); if(MinVal.size() == 0 || x < MinVal.top()) MinVal.push(x); else MinVal.push(MinVal原创 2015-06-30 19:33:22 · 309 阅读 · 0 评论 -
LeetCode || Pascal's Triangle II
class Solution {public: vector getRow(int rowIndex) { vector result; result.push_back(1); for(int i = 0;i<rowIndex;i++) { if(i == 0)原创 2015-06-30 19:55:04 · 267 阅读 · 0 评论 -
Climbing Stairs
class Solution {public: int climbStairs(int n) { //其实是斐波那契数列的变形问题,f(n) = f(n-1) + f(n-2) int last1 = 1, last2 = 1;//f0 = 1, f1 = 1 int result = 1; for(int i = 2;i<原创 2015-07-08 17:22:31 · 460 阅读 · 0 评论 -
LeetCode || Rotate Array
class Solution {public: void rotate(vector& nums, int k) { k = k % nums.size(); vector tmp; int n = nums.size(); for(int i = n-1;i>=n-k && i >=0;i--)原创 2015-06-30 20:53:26 · 218 阅读 · 0 评论 -
LeetCode || Sqrt(x)
class Solution {public: int mySqrt(int x) { if(x <= 0) return 0; int left = 0, right = min(x, 500000); int mid = (left + right)/2; int t = mid原创 2015-07-01 15:28:41 · 213 阅读 · 0 评论 -
LeetCode || Median of Two Sorted Arrays
第一种方法:题目意思是用log(m+n)的时间复杂度,但这个明显是(m+n)log(m+n)的时间复杂度,明显不符合要求,但是还是通过了测试accept. 主要是一个sort算法。注意当数量为偶数的时候,存在两个中数,需要求平均值。class Solution {public: double findMedianSortedArrays(vector& nums1, v原创 2015-07-01 16:48:02 · 250 阅读 · 0 评论 -
LeetCode || Excel Sheet Column Title
class Solution {public: string convertToTitle(int n) { vector t; while(n != 0) { n = n-1; t.push_back((n)%26); n = n / 26; }原创 2015-07-01 10:04:04 · 307 阅读 · 0 评论 -
LeetCode || Integer to Roman
class Solution {public: string intToRoman(int num) { char c[1000]; int pos = 0; if(num >= 1000) { for(int i = 0;i<num/1000;i++) c[pos++原创 2015-07-01 11:04:35 · 321 阅读 · 0 评论 -
LeetCode || Intersection of Two Linked Lists
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *ge原创 2015-06-30 18:33:57 · 236 阅读 · 0 评论 -
LeetCode || 未完成的题目
4、Median of Two Sorted Arrays题目链接, 已经解决的方式:解决方法分治法求解!!!原创 2015-07-01 20:06:38 · 341 阅读 · 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原创 2015-07-09 10:02:11 · 311 阅读 · 0 评论 -
Linked List Cycle II
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *de原创 2015-07-09 11:17:33 · 311 阅读 · 0 评论 -
Search a 2D Matrix
class Solution {public: bool searchMatrix(vector>& matrix, int target) { if(matrix.size() == 0) return false; bool result = false; int row = 0, col = matrix[0]原创 2015-07-12 09:38:51 · 530 阅读 · 0 评论 -
LeetCode ||Binary Tree Level Order Traversal
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-07-12 11:52:32 · 197 阅读 · 0 评论 -
Construct Binary Tree from Inorder and Postorder Traversal
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-07-12 11:10:07 · 234 阅读 · 0 评论 -
LeetCode || Binary Tree Postorder Traversal
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-07-12 17:14:10 · 250 阅读 · 0 评论 -
Construct Binary Tree from Preorder and Inorder Traversal
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-07-12 10:53:00 · 272 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node II
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL)原创 2015-07-12 19:29:12 · 188 阅读 · 0 评论 -
LeetCode || Implement Queue using Stacks
class Queue {public: // Push element x to the back of queue. void push(int x) { s1.push(x); } // Removes the element from in front of queue. void pop(void) { if(s原创 2015-07-12 11:16:42 · 316 阅读 · 0 评论 -
LeetCode || Implement Stack using Queues
class Stack {public: // Push element x onto stack. void push(int x) { q1.push(x); } // Removes the element on top of the stack. void pop() { if(q1.size() == 0)原创 2015-07-12 11:35:13 · 237 阅读 · 0 评论 -
Binary Tree Right Side View
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-07-12 19:07:15 · 281 阅读 · 0 评论 -
Binary Tree Level Order Traversal II
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-07-12 17:03:45 · 186 阅读 · 0 评论 -
Compare Version Numbers
class Solution {public: int compareVersion(string version1, string version2) { int a1 = 0, a2 = 0; int i1 = 0, i2 = 0; while(i1< version1.size() || i2 < version2.原创 2015-07-13 17:14:06 · 333 阅读 · 0 评论 -
String to Integer (atoi)
class Solution {public: int myAtoi(string str) { long long int result = 0;//注意,为了判断溢出,要定义为long long int int PositiveFlag = 1; int i = 0; if(str.size() == 0) re原创 2015-07-08 11:12:08 · 238 阅读 · 0 评论 -
Remove Nth Node From End of List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* re原创 2015-07-08 11:38:02 · 332 阅读 · 0 评论 -
LeetCode || Remove Duplicates from Sorted List II
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* de原创 2015-07-28 11:26:50 · 421 阅读 · 0 评论