public class Solution {
public int[] TwoSum(int[] nums, int target) {
if(nums == null || nums.Length < 1)
{
return null;
}
for(int i = 0; i < nums.Length; i++)
{
for(int j = i + 1; j < nums.Length; j++)
{
if(nums[i] + nums[j] == target)
{
return new int[2]{i, j};
}
}
}
return null;
}
}
LeetCode 1. Two Sum (Easy) LeetCode 1. Two Sum (Easy) 原题链...
1. Two Sum 题目:https://leetcode.com/problems/two-sum/ 难度: ...
1. Two Sum[https://leetcode-cn.com/problems/two-sum/] 字典（...
#1. Two Sum
Given an array of integers, return indices of the two num...
Description Given an array of integers, return indices of...
Problem Given an array of integers, return indices of the...
Given an array of integers, return indices of the two num...
Leetcode: 1. Two SumGiven an array of integers, return in...
本文标题：1. Two Sum
本文链接：https://www.haomeiwen.com/subject/mtsdsxtx.html
网友评论