发布时间：2015-09-08 17:16:39

<br /><div id="codeText" class="codeText"><ol style="margin:0 1px 0 0;padding:5px 0pt;" start="1" class="dp-css none_number"><li><span style="color:#000000;"><span style="color:#0000CC;">/</span><span style="color:#0000CC;">/</span> Forward declaration of isBadVersion API<span style="color.........【阅读全文】

发布时间：2015-09-02 09:54:00

<br /><div id="codeText" class="codeText"><ol style="margin:0 1px 0 0;padding:5px 0pt;" start="1" class="dp-css none_number"><li><span style="color:#000000;"><span style="color:#0000CC;">*</span><br /></span></li><li>&nbsp;<span style="color:#0000CC;">*</span> Definition <span s.........【阅读全文】

发布时间：2015-09-02 09:43:00

<br /><div id="codeText" class="codeText"><ol style="margin:0 1px 0 0;padding:5px 0pt;" start="1" class="dp-css none_number"><li><span style="color:#000000;"><span style="color:#0000CC;">/</span><span style="color:#0000CC;">*</span><span style="color:#0000CC;">*</span><br /></span></li.........【阅读全文】

发布时间：2015-08-18 09:05:41

<br /><div id="codeText" class="codeText"><ol style="margin:0 1px 0 0;padding:5px 0pt;" start="1" class="dp-css none_number"><li><span style="color:#000000;">void addtwobits<span style="color:#0000CC;">(</span>char <span style="color:#0000CC;">*</span>sum<span style="color:#0000CC;">,</spa.........【阅读全文】

发布时间：2015-08-18 07:01:54

<br /><div id="codeText" class="codeText"><ol style="margin:0 1px 0 0;padding:5px 0pt;" start="1" class="dp-css none_number"><li><span style="color:#000000;">uint32_t reverseBits<span style="color:#0000CC;">(</span>uint32_t n<span style="color:#0000CC;">)</span> <span style="color:#0000CC;.........【阅读全文】

发布时间：2015-08-17 22:14:09

/**
......【阅读全文】

发布时间：2015-08-17 21:48:59

/**
......【阅读全文】

发布时间：2015-08-17 21:19:47

<br /><div id="codeText" class="codeText"><ol style="margin:0 1px 0 0;padding:5px 0pt;" start="1" class="dp-css none_number"><li><span style="color:#000000;"><span style="color:#0000CC;">/</span><span style="color:#0000CC;">*</span><span style="color:#0000CC;">*</span><br /></span></li.........【阅读全文】

发布时间：2015-08-17 17:47:45

<br /><div id="codeText" class="codeText"><ol style="margin:0 1px 0 0;padding:5px 0pt;" start="1" class="dp-css none_number"><li><span style="color:#000000;"><span style="color:#0000CC;">/</span><span style="color:#0000CC;">*</span><span style="color:#0000CC;">*</span><br /></span></li.........【阅读全文】

发布时间：2015-08-17 16:46:48

<br /><div id="codeText" class="codeText"><ol style="margin:0 1px 0 0;padding:5px 0pt;" start="1" class="dp-css none_number"><li><span style="color:#000000;"><span style="color:#0000CC;">/</span><span style="color:#0000CC;">*</span><span style="color:#0000CC;">*</span><br /></span></li.........【阅读全文】

发布时间：2015-08-12 16:32:47

/**
 * Definition for singly-linked list.......【阅读全文】

发布时间：2015-08-12 15:21:50

https://leetcode.com/problems/add-two-numbers/<br /><div id="codeText" class="codeText"><ol style="margin:0 1px 0 0;padding:5px 0pt;" start="1" class="dp-css none_number"><li><span style="color:#000000;"><span style="color:#0000CC;">/</span><span style="color:#0000CC;">*</span><span style=.........【阅读全文】

发布时间：2015-07-29 16:26:59

/**
......【阅读全文】

发布时间：2015-07-28 20:12:37

<p style="box-sizing:border-box;margin-top:0px;margin-bottom:10px;color:#333333;font-family:'Helvetica Neue', Helvetica, Arial, sans-serif;font-size:14px;line-height:30px;white-space:normal;background-color:#FFFFFF;">Given a sorted array of integers, find the starting and ending position of a give.........【阅读全文】

发布时间：2015-07-11 13:01:40

https://leetcode.com/problems/word-frequency/<br /># Read from the file words.txt and output the word frequency list to stdout.<br />awk '{for(i=1;i&lt;=NF;i++){arr[$i]++}} END{for(w in arr){print w" "arr[w]}}' words.txt|sort -nrk 2<br />......【阅读全文】

发布时间：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-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.........【阅读全文】