package LeetCode.contact;
import java.util.Arrays;
class Solution_1 {
public int[] twoSum(int[] nums, int target) {
int arr[] = new int[2];
boolean isFlag = true;
while(isFlag){
for(int i = 0; i < nums.length; i ++){
for(int j = i+1; j 
