I felt like doing an algorithm and found this problem on leetcode
Given an array of integers, find two numbers such that they add up to a specific target num
public static int[] twoSum(int[] nums, int target) { int []resultarray=new int[2]; for (int i=0;i