leetcode week3-1

two-sum/bus710.go

@@ -0,0 +1,15 @@
+// O(n/2) as we only visit the half of the i*j
+
+package hello
+
+func twoSum(nums []int, target int) []int {
+	for i := range nums {
+		for j := i + 1; j < len(nums); j++ {
+			if (nums[i] + nums[j]) == target {
+				return []int{i, j}
+			}
+		}
+	}
+
+	return nil
+}