keepshuatishuati - 博客园

2015年3月24日

摘要： Do not forget to assign size value of matrix. This is very important!!!! 1 class Solution { 2 public: 3 vector > generateMatrix(int n) { 4 ... 阅读全文

posted @ 2015-03-24 14:39 keepshuatishuati 阅读(122) 评论(0) 推荐(0)

LeetCode – Refresh – Spiral Matrix

摘要： When finally check the middle line, it is checking whether the min(n, m) is odd or even number. 1 class Solution { 2 public: 3 vector spiralOrder(... 阅读全文

posted @ 2015-03-24 14:34 keepshuatishuati 阅读(129) 评论(0) 推荐(0)

LeetCode – Refresh – Sort List

摘要： Use merge sort. Recursively call the function: 1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val; 5 * ListNod... 阅读全文

posted @ 2015-03-24 14:24 keepshuatishuati 阅读(133) 评论(0) 推荐(0)

2015年3月23日

LeetCode - Refresh - Sort Colors

摘要： 1 class Solution { 2 public: 3 void sortColors(int A[], int n) { 4 auto swap = [](int &a, int &b){int t = a; a = b; b = t;}; 5 in... 阅读全文

posted @ 2015-03-23 15:11 keepshuatishuati 阅读(127) 评论(0) 推荐(0)

LeetCode - Refresh - Single Number II

摘要： 1 class Solution { 2 public: 3 int singleNumber(int A[], int n) { 4 int ones = 0, twos = 0, threes = 0; 5 for (int i = 0; i < n; ... 阅读全文

posted @ 2015-03-23 15:08 keepshuatishuati 阅读(141) 评论(0) 推荐(0)

LeetCode - Refresh - Single Number

摘要： You can use a hash map to record the frequencys. Or you can use bit operation.x ^ x = 0. So the only left is the one. 1 class Solution { 2 public: 3 ... 阅读全文

posted @ 2015-03-23 15:05 keepshuatishuati 阅读(81) 评论(0) 推荐(0)

LeetCode - Refresh - Simplify Path

摘要： I split it in the reverse way. So all the following code should do reverse way. 1 class Solution { 2 public: 3 vector splits(string s) { 4 ... 阅读全文

posted @ 2015-03-23 15:00 keepshuatishuati 阅读(123) 评论(0) 推荐(0)

LeetCode - Refresh - Set Matrix Zeroes

摘要： You can use two array to record the zeros. Also you can do it in memory: 1 class Solution { 2 public: 3 void setZeroes(vector > &matrix) { 4 ... 阅读全文

posted @ 2015-03-23 13:50 keepshuatishuati 阅读(107) 评论(0) 推荐(0)

LeetCode - Refresh - Search Insert Position

摘要： Regular binary search 1 class Solution { 2 public: 3 int searchInsert(int A[], int n, int target) { 4 int start = 0, end = n-1, mid = 0; 5... 阅读全文

posted @ 2015-03-23 13:23 keepshuatishuati 阅读(94) 评论(0) 推荐(0)

LeetCode - Refresh - Search in Rotated Sorted Array II

摘要： Just skip the duplicated ones. 1 class Solution { 2 public: 3 bool search(int A[], int n, int target) { 4 int start = 0, end = n-1, mid = ... 阅读全文

posted @ 2015-03-23 13:13 keepshuatishuati 阅读(120) 评论(0) 推荐(0)