2014年08月_尘埃092

11月 09月 08月 05月 03月

原创 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 527

原创 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 415

原创 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 470

原创 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 565

原创 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 536

原创 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 473

原创 Climbing Stairs

这题是个斐波那契数列，规律很好找，不过dfs这题

2014-08-12 14:17:28 461

原创 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 435

原创 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 683

原创 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 378

原创 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 529

原创 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 475

原创 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 526

原创 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 464

原创 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 534