diff --git "a/2209040041/chapter_1/lc_1\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214.cpp" "b/2209040041/chapter_1/lc_1\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214.cpp" deleted file mode 100644 index aff7219a740cbfe490e2d98737022ff730149eca..0000000000000000000000000000000000000000 --- "a/2209040041/chapter_1/lc_1\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214.cpp" +++ /dev/null @@ -1,24 +0,0 @@ -int arrSum(int* arr, int start, int end){ - int i, res = 0; - for(i = start; i < start + end; i++) - { - res += arr[i]; - } - - return res; -} -int sumOddLengthSubarrays(int* arr, int arrSize){ - int i = 0; - int j = 0; - int k = 0; - int ans = 0; - - for(i = 1; i <= arrSize; i += 2){ - for(j = 0; j < i; j += i){ - for(k = j; k < arrSize - i + 1;k++){ - ans += arrSum(arr, k ,i); - } - } - } - return ans; -} \ No newline at end of file diff --git "a/2209040047/chap1/\344\270\244\346\225\260\344\271\213\345\222\214.cpp" "b/2209040047/chap1/\344\270\244\346\225\260\344\271\213\345\222\214.cpp" new file mode 100644 index 0000000000000000000000000000000000000000..b2970706e508d578b0321bea2c6d8f740cc5de90 --- /dev/null +++ "b/2209040047/chap1/\344\270\244\346\225\260\344\271\213\345\222\214.cpp" @@ -0,0 +1,6 @@ +#include +int main() +{ + printf("HELLO WORLD"); + return 0; +} \ No newline at end of file diff --git "a/2209040079/chapter 1/lc \344\270\244\346\225\260\344\271\213\345\222\214.cpp" "b/2209040079/chapter 1/lc \344\270\244\346\225\260\344\271\213\345\222\214.cpp" deleted file mode 100644 index 18918d6b5fe727cc5bc6f0e3e3fd371f5766974b..0000000000000000000000000000000000000000 --- "a/2209040079/chapter 1/lc \344\270\244\346\225\260\344\271\213\345\222\214.cpp" +++ /dev/null @@ -1,14 +0,0 @@ -class Solution { -public: - vector twoSum(vector& nums, int target) { - unordered_map hash; - for (int i = 0; i < nums.size(); ++i) - { - if (hash.find(target - nums[i]) != hash.end()) - return { hash[target - nums[i]],i }; - else - hash[nums[i]] = i; - } - return {}; -} -}; \ No newline at end of file