728x90
https://leetcode.com/problems/two-sum/description/
public class Solution {
public int[] TwoSum(int[] nums, int target)
{
var dict = new Dictionary<int, int>();
for (int i = 0; i < nums.Length; i++)
{
if (dict.TryGetValue(nums[i], out int index))
{
return new int[] { index, i };
}
else
{
dict[target - nums[i]] = i;
}
}
return null;
}
}
728x90
'Programing > Algorithm' 카테고리의 다른 글
[LeetCode] 6. Zigzag Conversion (0) | 2025.02.07 |
---|---|
[LeetCode] 5. Longest Palindromic Substring (0) | 2025.02.07 |
[LeetCode] 4. Median of Two Sorted Arrays (0) | 2025.01.21 |
[LeetCode] 3. Longest Substring Without Repeating Characters (0) | 2025.01.20 |
[LeetCode] 2. Add Two Numbers (0) | 2025.01.20 |