LeetCode
尘埃092
这个作者很懒,什么都没留下…
展开
-
Integer to Roman
class Solution { public: string intToRoman(int num) { string ret; string x[] = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I" }; int value[] = {10原创 2014-08-21 12:45:47 · 435 阅读 · 0 评论 -
Roman to Integer
class Solution { public: int romanToInt(string s) { int flag = 1, num = 0; map m; m['I'] = 1; m['V'] = 5; m['X'] = 10; m['L'] = 50; m['C']原创 2014-08-17 16:45:38 · 559 阅读 · 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-08-17 15:49:48 · 494 阅读 · 0 评论 -
N-Queens II
class Solution { public: #define N 30 int A[N] = {0}; int max; int sum; int canput( int k ) { for( int i = 1; i < k; i++ ) if( A[i] == A[k] || abs(i-k) == abs(A原创 2014-08-28 15:05:13 · 548 阅读 · 0 评论 -
Binary Tree Inorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti原创 2014-08-09 19:50:16 · 555 阅读 · 0 评论 -
Binary Tree Preorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ //递归版 clas原创 2014-08-09 19:35:27 · 490 阅读 · 0 评论 -
Search Insert Position
class Solution { public: int searchInsert(int A[], int n, int target) { int begin, mid, end; begin = 0; end = n-1; while( begin < end ) { mid = (end+beg原创 2014-08-11 12:33:42 · 454 阅读 · 0 评论 -
Climbing Stairs
这题是个斐波那契数列,规律很好找,不过dfs这题原创 2014-08-12 14:17:28 · 476 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node
/** * 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)原创 2014-08-10 16:59:10 · 493 阅读 · 0 评论 -
Linked List Cycle
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: bool hasCycl原创 2014-08-09 19:34:06 · 553 阅读 · 0 评论 -
Reverse Integer
class Solution { public: int reverse(int x) { int sum = 0; while( x ) { sum = sum * 10 + x % 10; x /= 10; } return sum; } };原创 2014-08-10 17:03:52 · 706 阅读 · 0 评论 -
Maximum Depth of 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-08-10 17:00:59 · 548 阅读 · 0 评论 -
Single Number
class Solution { public: int singleNumber(int A[], int n) { int i, sum = 0; for( i = 0; i < n; i++ ) { sum ^= A[i]; } return sum; } };原创 2014-08-10 17:02:15 · 404 阅读 · 0 评论 -
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 *me原创 2014-08-21 12:25:35 · 489 阅读 · 0 评论 -
Remove Element
class Solution { public: int removeElement(int A[], int n, int elem) { int pos = 0; for( int i = 0; i < n; i++ ) { if( elem != A[i] ) {原创 2014-08-18 18:38:43 · 587 阅读 · 0 评论