<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]:
        # find the closest element to x
        # put 2 pointers there
        # check which is closer (left of the left, or right of the right), then move that pointer there
        # keep going until k elements found
        # iterate from the left all the way to the right and append to output list

        closest_idx = 0
        min_dist = inf
        for i in range(len(arr)):
            dist = abs(arr[i] - x)
            if dist < min_dist:
                min_dist = dist
                closest_idx = i

        left, right = closest_idx, closest_idx
        while right-left < k-1:
            left_dist = abs(arr[left-1] - x) if left > 0 else inf
            right_dist = abs(arr[right+1] - x) if right < len(arr)-1 else inf

            if left_dist <= right_dist:
                left -= 1
            else:
                right += 1
                
        output = []
        for i in range(left, right+1):
            output.append(arr[i])
        return output
17600