- 博客(3)
- 收藏
- 关注
RSS订阅原创 Leetcode_Reverse Integer[easy]
Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 Analysis: please consider the overflows, the 32 bits integers are from -2^(31) to 2^(31)-1 the f
2016-12-07 20:56:44
152
原创 LeetCode_Add Two Numbers(Medium)
Problem: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and retur
2016-12-06 10:40:22
186
原创 Leetcode_Two Sum
/** the first version/** * Note: The returned array must be malloced, assume caller calls free(). */ int* twoSum(int* nums, int numsSize, int target) { int i,j; int *pos; int flag = 0;
2016-12-05 20:48:57
218
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人