摘要：
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
阅读(122)
推荐(0)
编辑
摘要：
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
阅读(135)
推荐(0)
编辑
摘要：
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
阅读(78)
推荐(0)
编辑
摘要：
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
阅读(115)
推荐(0)
编辑
摘要：
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
阅读(96)
推荐(0)
编辑
摘要：
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
阅读(87)
推荐(0)
编辑
摘要：
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
阅读(116)
推荐(0)
编辑
