From 0f4d5cb03e4b3c993d334520ad22033008729da3 Mon Sep 17 00:00:00 2001
From: bel <bel@bel.bel>
Date: Tue, 28 Oct 2025 12:53:21 -0600
Subject: [PATCH] fialed

---
 go.mod                                  |  3 +
 literally_five_more_minutes_over_17m.go | 78 ++++++++++++++++++++++
 main.go                                 | 89 +++++++++++++++++++++++++
 3 files changed, 170 insertions(+)
 create mode 100644 go.mod
 create mode 100644 literally_five_more_minutes_over_17m.go
 create mode 100644 main.go

diff --git a/go.mod b/go.mod
new file mode 100644
index 0000000..5313421
--- /dev/null
+++ b/go.mod
@@ -0,0 +1,3 @@
+module gitea/2025-10-28_crossnokaye
+
+go 1.25.3
diff --git a/literally_five_more_minutes_over_17m.go b/literally_five_more_minutes_over_17m.go
new file mode 100644
index 0000000..bc156ec
--- /dev/null
+++ b/literally_five_more_minutes_over_17m.go
@@ -0,0 +1,78 @@
+// Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
+
+// Input: nums1 = [1,3], nums2 = [2]
+// Output: 2.00000
+// Explanation: merged array = [1,2,3] and median is 2.
+
+// Input: nums1 = [1,2], nums2 = [3,4]
+// Output: 2.50000
+// Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
+
+package main
+
+import "log"
+
+func main() {
+	log.Println("CASE A SHOULD BE 2:", medianOfArrays(
+		[]int{1, 3},
+		[]int{2},
+	))
+	log.Println("CASE B SHOULD BE 2.5:", medianOfArrays(
+		[]int{1, 2},
+		[]int{3, 4},
+	))
+}
+
+func medianOfArrays(a, b []int) float64 {
+	valueCount := len(a) + len(b)
+	mustGetAverage := (valueCount%2 == 0)
+	needToSkip := valueCount / 2
+	if !mustGetAverage {
+		needToSkip += 1
+	}
+	needToSkip -= 1
+
+	skippedA, skippedB := 0, 0
+	for needToSkip > skippedA+skippedB {
+		log.Println(needToSkip, skippedA, skippedB)
+		aExhausted := skippedA >= len(a)
+		bExhausted := skippedB >= len(b)
+		if aExhausted || b[skippedB] < a[skippedA] {
+			skippedB += 1
+		} else if bExhausted || a[skippedA] < b[skippedB] {
+			skippedA += 1
+		} else if !aExhausted && !bExhausted {
+			skippedA += 1 // [1, 2, 3]  vs  [2, 2, 2]
+		}
+	}
+
+	if mustGetAverage {
+		log.Println("need to avg lowest of", a[skippedA:], b[skippedB:])
+		fromA, lowest := getLowestOfArrays(a[skippedA:], b[skippedB:])
+		log.Println("got", fromA, lowest)
+		if fromA {
+			skippedA += 1
+		} else {
+			skippedB += 1
+		}
+		log.Println("'need to avg lowest of", a[skippedA:], b[skippedB:])
+		_, secondLowest := getLowestOfArrays(a[skippedA:], b[skippedB:])
+		log.Println("avg(", lowest, secondLowest)
+		return (float64(lowest) + float64(secondLowest)) / 2
+	}
+	_, lowest := getLowestOfArrays(a[skippedA:], b[skippedB:])
+	return float64(lowest)
+}
+
+func getLowestOfArrays(a, b []int) (fromA bool, lowest int) {
+	if len(a) == 0 {
+		return false, b[0]
+	}
+	if len(b) == 0 {
+		return true, a[0]
+	}
+	if a[0] < b[0] {
+		return true, a[0]
+	}
+	return false, b[0]
+}
diff --git a/main.go b/main.go
new file mode 100644
index 0000000..4609417
--- /dev/null
+++ b/main.go
@@ -0,0 +1,89 @@
+// Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
+
+// Input: nums1 = [1,3], nums2 = [2]
+// Output: 2.00000
+// Explanation: merged array = [1,2,3] and median is 2.
+
+// Input: nums1 = [1,2], nums2 = [3,4]
+// Output: 2.50000
+// Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
+
+package main
+
+import "log"
+
+func main() {
+	log.Println(medianOfArrays(
+		[]int{1, 3},
+		[]int{2},
+	))
+	log.Println(medianOfArrays(
+		[]int{1, 2},
+		[]int{3, 4},
+	))
+}
+
+func medianOfArrays(a, b []int) float64 {
+	valueCount := len(a) + len(b)
+	mustGetAverage := (valueCount%2 == 0)
+	needToSkip := valueCount / 2
+	if !mustGetAverage {
+		needToSkip += 1
+	}
+	needToSkip -= 1
+
+	skippedA, skippedB := 0, 0
+	for needToSkip > skippedA+skippedB {
+		log.Println(needToSkip, skippedA, skippedB)
+		aExhausted := skippedA >= len(a)
+		bExhausted := skippedB >= len(b)
+		if aExhausted || b[skippedB] < a[skippedA] {
+			skippedB += 1
+		} else if bExhausted || a[skippedA] < b[skippedB] {
+			skippedA += 1
+		} else if !aExhausted && !bExhausted {
+			skippedA += 1
+		}
+	}
+
+	log.Println(needToSkip, a, skippedA, b, skippedB)
+	if bothArraysHaveValues := skippedA < len(a) && skippedB < len(b); bothArraysHaveValues {
+		if mustGetAverage {
+			log.Println("need to avg lowest of", a[:skippedA], b[:skippedB])
+			fromA, lowest := getLowestOfArrays(a[skippedA:], b[skippedB:])
+			if fromA {
+				skippedA += 1
+			} else {
+				skippedB += 1
+			}
+			_, secondLowest := getLowestOfArrays(a[skippedA:], b[skippedB:])
+			return float64(lowest) + float64(secondLowest)/2
+		}
+		_, lowest := getLowestOfArrays(a[skippedA:], b[skippedB:])
+		return float64(lowest)
+	}
+
+	if aExhausted := skippedA >= len(a); aExhausted {
+		if mustGetAverage {
+			panic("not impl")
+		}
+		return float64(b[skippedB])
+	}
+	if mustGetAverage {
+		panic("not impl")
+	}
+	return float64(a[skippedA])
+}
+
+func getLowestOfArrays(a, b []int) (fromA bool, lowest int) {
+	if len(a) == 0 {
+		return false, b[0]
+	}
+	if len(b) == 0 {
+		return true, a[0]
+	}
+	if a[0] > b[0] {
+		return true, a[0]
+	}
+	return false, b[0]
+}