From 036b458ed0dc0e9d3b6d4b49e40c180bd0761d86 Mon Sep 17 00:00:00 2001 From: N <2304238596@qq.com> Date: Sun, 10 Sep 2023 15:15:35 +0000 Subject: [PATCH] test --- ...244\346\225\260\344\271\213\345\222\214.cpp" | 17 +++++++++++++++++ ...260\347\273\204\347\232\204\345\222\214.cpp" | 16 ++++++++++++++++ 2 files changed, 33 insertions(+) create mode 100644 "2209040039/chapter1/\344\270\244\346\225\260\344\271\213\345\222\214.cpp" create mode 100644 "2209040039/chapter1/\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\347\232\204\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214.cpp" diff --git "a/2209040039/chapter1/\344\270\244\346\225\260\344\271\213\345\222\214.cpp" "b/2209040039/chapter1/\344\270\244\346\225\260\344\271\213\345\222\214.cpp" new file mode 100644 index 00000000..524fc4af --- /dev/null +++ "b/2209040039/chapter1/\344\270\244\346\225\260\344\271\213\345\222\214.cpp" @@ -0,0 +1,17 @@ + + +class Solution { +public: + vector twoSum(vector& nums, int target) { + unordered_mapun_map; + vectorres; + for (int i = 0; i < nums.size(); i++) { + if (un_map.find(target - nums[i]) != un_map.end()) { + res.push_back(i); + res.push_back(un_map[target - nums[i]]); + } + un_map[num[i]] = i; + } + return res; + } +}; \ No newline at end of file diff --git "a/2209040039/chapter1/\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\347\232\204\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214.cpp" "b/2209040039/chapter1/\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\347\232\204\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214.cpp" new file mode 100644 index 00000000..67379690 --- /dev/null +++ "b/2209040039/chapter1/\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\347\232\204\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214.cpp" @@ -0,0 +1,16 @@ +int sumOddLengthSubarrays(int* arr, int arrSize) +{ + int sum = 0; + for (int i = 0; i < arrSize; i++) + { + int n = (arrSize - i) % 2 == 0 ? (arrSize - i) - 1 : arrSize - i; + for (int size = 1; size <= n; size += 2) + { + for (int j = 0; j < size; j++) + { + sum += arr[i + j]; + } + } + } + return sum; +} \ No newline at end of file -- Gitee