发布时间：2015-03-03 16:45:33

反转链表#includestruct ListNode{    int m_nKey;    struct ListNode* m_pNext;};void ReverseList(struct ListNode** pHead).........【阅读全文】

发布时间：2015-03-21 13:06:09

#include#includetypedef struct list{    int data;    struct list *next;}list;void swap(int *a,int *b){    int .........【阅读全文】

发布时间：2015-03-17 19:05:41

Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.int hammingWeigh.........【阅读全文】

发布时间：2015-03-14 10:47:57

2013年，过的很充实，生活上如此，技术上亦是。这一年，看了很多的技术资料，技术上也有了很大的提高。而且，本着分享的精神，很多好的技术资料，也都在个人微博@何_登成 上做了推荐。今天，下定决心将整个2013年在微博上推荐的技术资料整理了一下，说真的，写的不少，看的更多。 下面的这些资料，都是.........【阅读全文】

发布时间：2015-03-04 13:42:27

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNod.........【阅读全文】

发布时间：2015-03-04 12:40:33

Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m andn respectiv.........【阅读全文】

发布时间：2015-03-04 10:51:13

double myPow(double x, int n) {        if(n==1)         return x;        if(n==0)  &nb.........【阅读全文】