摘要:
int lengthOfLongestSubstring(char* s){ int len=0; int start=0; int end=0; char map[128]={0}; map[(int)*(s+start)]=1; while(*(s+end)!='\0') { // if(map 阅读全文
摘要:
LeetCode:反转链表 /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* reverseList(st 阅读全文