From 34e91baddea984ac34a1c89eaf52d6123f716d7f Mon Sep 17 00:00:00 2001 From: yubin <59639035+gogumaC@users.noreply.github.com> Date: Sat, 4 Jan 2025 16:41:56 +0900 Subject: [PATCH] Delete 0001-two-sum directory --- 0001-two-sum/0001-two-sum.c | 24 ---------------------- 0001-two-sum/README.md | 41 ------------------------------------- 2 files changed, 65 deletions(-) delete mode 100644 0001-two-sum/0001-two-sum.c delete mode 100644 0001-two-sum/README.md diff --git a/0001-two-sum/0001-two-sum.c b/0001-two-sum/0001-two-sum.c deleted file mode 100644 index f475f8b..0000000 --- a/0001-two-sum/0001-two-sum.c +++ /dev/null @@ -1,24 +0,0 @@ -/** - * Note: The returned array must be malloced, assume caller calls free(). - */ -int* twoSum(int* nums, int numsSize, int target, int* returnSize) { - - int* res = (int *)malloc(sizeof(int)*2); - *returnSize = 2; - - for(int i=0; i1. Two Sum

Easy

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

- -

You may assume that each input would have exactly one solution, and you may not use the same element twice.

- -

You can return the answer in any order.

- -

 

-

Example 1:

- -
-Input: nums = [2,7,11,15], target = 9
-Output: [0,1]
-Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
-
- -

Example 2:

- -
-Input: nums = [3,2,4], target = 6
-Output: [1,2]
-
- -

Example 3:

- -
-Input: nums = [3,3], target = 6
-Output: [0,1]
-
- -

 

-

Constraints:

- - - -

 

-Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity? \ No newline at end of file