Leetcode
Qinchaowhut
CS
展开
-
Search a 2D Matrix
//https://leetcode.com/problems/search-a-2d-matrix/bool searchMatrix(int** matrix, int matrixRowSize, int matrixColSize, int target) { int i=matrixRowSize-1;//行; int j=0;//列; while((i>原创 2015-07-12 20:15:28 · 374 阅读 · 0 评论 -
Search for a Range
/** * Return an array of size: *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */int* searchRange(int* nums, int numSize, int target, int* returnSize) { *r原创 2015-07-28 20:12:50 · 483 阅读 · 0 评论 -
Insertion Sort List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* in原创 2015-07-29 14:28:56 · 609 阅读 · 0 评论 -
Add Binary
void addtwobits(char *sum,char a,char b,int *carry){ *sum=(((a-'0')+(b-'0')+*carry)&0x01)+'0'; *carry=((a-'0')+(b-'0')+*carry)>>1;}void revert(char *a,int *len){ int i=0; *len=strl原创 2015-08-18 09:08:19 · 554 阅读 · 0 评论