leetcode
TS1130
这个作者很懒,什么都没留下…
展开
-
1.Two Sum
/** * Note: The returned array must be malloced, assume caller calls free(). */ int* twoSum(int* nums, int numsSize, int target) { static int res[2] = {0}; for(int i = 0; i < numsSize; i原创 2016-09-17 11:22:30 · 385 阅读 · 0 评论 -
2.Add Two Numbers
/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) { if原创 2016-09-17 11:28:15 · 282 阅读 · 0 评论 -
3.Longest Substring Without Repeating Characters
typedef struct Node{ int num; struct Node* next;}Node, *pNode;int lengthOfLongestSubstring(char* s) { pNode arr[128] = {NULL}; for (int i = 0; i < 128; i++) { arr[i] =原创 2016-09-18 09:21:05 · 342 阅读 · 0 评论 -
4. Median of Two Sorted Arrays
double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size) { if (nums1Size == 0 && nums2Size == 0) return -1; else if (nums1Size == 1 && nums2Size == 1) {原创 2016-09-18 20:40:24 · 306 阅读 · 0 评论 -
5. Longest Palindromic Substring
char* longestPalindrome(char* s) { int sSize = strlen(s); int maxBegan = 0; int maxLenth = 0, lenth = 0; for (int i = 0; i < sSize; i++) { int j = 1; int k = 0;原创 2016-09-24 20:27:15 · 353 阅读 · 0 评论 -
6. ZigZag Conversion
char* convert(char* s, int numRows) { int k = 0; int iSize = strlen(s); char *p = (char *)malloc(sizeof(char)*(iSize + 1)); for (int i = 0; i < numRows; i++) { int j = i;原创 2016-09-24 20:30:29 · 327 阅读 · 0 评论 -
7. Reverse Integer
int reverse(int x) { int y = (x < 0) ? -x : x; int temp[10] = { 0 }, i = 0, j = 0; while (y > 0) { temp[i] = y % 10; y /= 10; i++; } double res = 0;原创 2016-09-25 11:36:51 · 285 阅读 · 0 评论 -
8. String to Integer (atoi)
bool isPalindrome(int x) { if (x < 0) return false; else if(x == 0) return true; int i = 1, j = 0; while (true) { if (pow(10.0, i - 1) <= x && x < pow(10.0, i))原创 2016-09-25 11:39:01 · 362 阅读 · 0 评论 -
9. Palindrome Number
bool isPalindrome(int x) { if (x < 0) return false; else if(x == 0) return true; int i = 1, j = 0; while (true) { if (pow(10.0, i - 1) <= x && x < pow(10.0, i))原创 2016-09-25 11:40:21 · 313 阅读 · 0 评论