- 博客(7)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 LeetCodeOJ: 38. Count and Say
Total Accepted: 75530 Total Submissions: 265272 Difficulty: EasyThe count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "
2016-03-23 21:18:50
328
原创 LeetCodeOJ:206 Reverse Linked List
Total Accepted: 95123 Total Submissions: 244712 Difficulty: EasyReverse a singly linked list./** * Definition for singly-linked list. * struct ListNode { * int val; * struct
2016-03-23 20:40:18
320
原创 LeetCodeOJ:338. Counting Bits
Total Accepted: 4466 Total Submissions: 8073 Difficulty: MediumGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their
2016-03-22 11:49:29
423
原创 LeetCodeOJ:2. Add Two Numbers
Total Accepted: 129010 Total Submissions: 572407 Difficulty: MediumYou are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of
2016-03-20 14:20:35
323
原创 LeetCodeOJ：1Two Sum
Total Accepted: 203765 Total Submissions: 923425 Difficulty: EasyGiven an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume
2016-03-20 13:39:09
347
原创 LeetCode OJ: 12 Integer to Roman
Total Accepted: 59069 Total Submissions: 155093 Difficulty: MediumGiven an integer, convert it to a roman numeral.Input is guaranteed to be with
2016-03-20 11:07:12
265
原创 fgets函数和gets函数
请找出下面代码里的问题：#include int main(void) { char buff[10]; memset(buff,0,sizeof(buff)); gets(buff); printf("\n The buffer entered is [%s]\n",buff); return 0; }答：先看看fg
2016-03-02 20:41:36
515
设计模式之禅
2015-04-23
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人