<p>Given a <strong>sorted</strong> integer array <code>arr</code>, two integers <code>k</code> and <code>x</code>, return the <code>k</code> closest integers to <code>x</code> in the array. The result should also be sorted in ascending order.</p>

<p>An integer <code>a</code> is closer to <code>x</code> than an integer <code>b</code> if:</p>

<ul>
	<li><code>|a - x| &lt; |b - x|</code>, or</li>
	<li><code>|a - x| == |b - x|</code> and <code>a &lt; b</code></li>
</ul>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> arr = [1,2,3,4,5], k = 4, x = 3
<strong>Output:</strong> [1,2,3,4]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> arr = [1,2,3,4,5], k = 4, x = -1
<strong>Output:</strong> [1,2,3,4]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= arr.length</code></li>
	<li><code>1 &lt;= arr.length &lt;= 10<sup>4</sup></code></li>
	<li><code>arr</code> is sorted in <strong>ascending</strong> order.</li>
	<li><code>-10<sup>4</sup> &lt;= arr[i], x &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution:
    def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:

        m = len(arr)
        if x < arr[0]:
            return arr[:k]

        if x > arr[-1]:
            return arr[m-k:]

        def getBounds():
            left = 0
            right = m - 1
            while left <= right:
                mid = left + (right - left) // 2
                print('mid: ' + str(arr[mid]))
                if x == arr[mid]: # if we found the value just break
                    return mid, mid
                elif x > arr[mid]:
                    left = mid + 1
                else:
                    right = mid - 1
            return right, left

        print(getBounds())
        ans = []
        left, right = getBounds()
        if left == right:
            ans.append(arr[left])
            left -= 1
            right += 1

        while len(ans) < k: # loop until we have the closest values
            if left >= 0:
                left_distance = abs(arr[left] - x)
            else:
                left_distance = float('inf')
            if right < m:
                right_distance = abs(arr[right] - x)
            else:
                right_distance = float('inf')

            if left_distance > right_distance:
                ans.append(arr[right])
                right += 1
            elif left_distance < right_distance:
                ans.append(arr[left])
                left -= 1
            else:
                ans.append(arr[left])
                left -= 1

        return sorted(ans)


18200