//
//#include<iostream>
////char* replaceSpace(char* s) {
////    int len = strlen(s) * 4 + 1;
////    char* tmp = (char*)malloc(sizeof(char) * len);
////    memset(tmp, 0, sizeof(char) * len);
////    int i = 0;
////    int j = 0;
////    while (s[i] != '\0')
////    {
////        if (s[i] == ' ')
////        {
////            strcat(tmp, "%20");
////            j += 3;
////            i++;
////        }
////        else
////        {
////            tmp[j++] = s[i++];
////        }
////    }
////    return tmp;
////}
////
////int main()
////{
////    char str[] = "We are happy.";
////    char* ret = replaceSpace(str);
////    std::cout << ret << std::endl;
////    return 0;
////
//#include"func.h"
//
//int func(char ch)
//{
//	return 10;
//}
//
//int main()
//{
//	//int ret = func('a');
//	//std::cout << ret;
//	int a = 10;
//	int* const b =&a;
//	*b = 20;
//
//	std::cout << a;
//	return 0;
//}
///**
// * Definition for singly-linked list.
// * struct ListNode {
// *     int val;
// *     struct ListNode *next;
// * };
// */
//
//
// /**
//  * Note: The returned array must be malloced, assume caller calls free().
//  */
//int* reversePrint(struct ListNode* head, int* returnSize) {
//    int len = 0;
//    struct ListNode* cur = head;
//    while (cur != NULL)
//    {
//        len++;
//        cur = cur->next;
//    }
//    int* ret = (int*)malloc(sizeof(int) * len);
//    int i = len;
//    cur = head;
//    while (i--)
//    {
//        ret[i] = cur->val;
//        cur = cur->next;
//    }
//    *returnSize = len;
//    return ret;
//}