MrGeroge的博客

wwww

Description: iven a string, find the length of the longest substring without repeating characters. Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answer is "b"

#include #include #include struct ListNode {      int val;      struct ListNode *next;  };  struct ListNode* addTwoNumbers(struct ListNode* l1,struct ListNode* l2){  //无头指针    struct ListNo

description: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 return

Description：Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution. solution： i

Description: There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1:

char* longestPalindrome(char* s) {  //寻找s中的最长回文子串     if(s[0]=='\0'){  //判断s是否为空        char t[]={'\0'};        return t;     }     else{         int array=0; //s的维数         while(s[array]!='\0

前言 1.MapReduce计算框架流程 Mapper（映射器）： 1）对数据进行分片，划分成多个Splits（每个Split按照块大小划分），每个Split都对应一个Mapper 2）Mapper对应的将Split中的数据进行映射成（key，value） Reducer（归约器） 对Mapper处理后的数据依次进行排序（默认按照字典排序），混洗，分组（Partitioner进行分区，...