leetcode 1. Two Sum
来源:互联网 发布:淘宝自动上架怎么设置 编辑:程序博客网 时间:2024/06/05 07:24
public class Solution {
public int[] twoSum(int[] nums, int target) {
int[] arr = {0,1};
for(int i = 0;i < nums.length; i++){
for(int j = 0;j< nums.length;j++){
if(nums[i]+nums[j]==target){
arr[0] = i;
arr[1] = j;
return arr;
}
}
}
return arr;
}
public int[] twoSum(int[] nums, int target) {
int[] arr = {0,1};
for(int i = 0;i < nums.length; i++){
for(int j = 0;j< nums.length;j++){
if(nums[i]+nums[j]==target){
arr[0] = i;
arr[1] = j;
return arr;
}
}
}
return arr;
}
阅读全文
0 0
- LeetCode 1. Two Sum
- [LeetCode]1.Two Sum
- LeetCode 1.Two Sum
- LeetCode --- 1. Two Sum
- [Leetcode] 1. Two Sum
- leetcode---1.Two sum
- [Leetcode] 1. Two Sum
- LeetCode 1.Two Sum
- LeetCode 1.Two Sum
- LeetCode 1.Two Sum
- 【LeetCode]1.Two Sum
- LeetCode 1.Two Sum
- leetcode 1. Two Sum
- [leetcode] 1. Two Sum
- leetcode 1. Two Sum
- Leetcode- 1. Two Sum
- LeetCode-1.Two Sum
- Leetcode 1. Two Sum
- 刷题
- onok oncancel ondestroy onclose
- JAVA中一个对象实例化的过程
- 远程
- 区块链数据库
- leetcode 1. Two Sum
- leetcode--寻找规律题,统计总数之类题目--待更
- 正则表达式
- 如何构建Android MVVM应用程序
- 我心中的AI
- Android 根据包名判断 App 运行状态
- MySql高级查询
- junit4的基本注解
- linux tar.gz 文件压缩,解压