O(n^2) solution in Java


  • 2
    O
    public class Solution {
        public int[] twoSum(int[] nums, int target) {
            int[] result = new int[2];
            for(int i = 0; i < nums.length; i++) {
                    for(int j = i+1; j < nums.length; j++) {
                        if (nums[i]+nums[j] == target) {
                            result[0] = i;
                            result[1] = j;
                            return result;
                        }
                    }
            }
            
            return result;
        }
    }

  • 0
    R

    You may define a variable of nums.length to gain tiny enhancement.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.