<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/k-radius-subarray-averages/description/">K Radius Subarray Averages - LeetCode</a></p>
<h2 id="heading-code">Code</h2>
<p><a target="_blank" href="https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/2090/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/2090/main.fsx</a></p>
<pre><code class="lang-plaintext">let getAverage (nums: int[]) (k: int) : int[] =
    let len = Array.length nums
    let windowSize = 2 * k + 1

    if windowSize &gt; len then
        Array.init len (fun _ -&gt; -1)
    else
        let sum = Array.take windowSize nums |&gt; Array.sum |&gt; int64
        let windowSize' = int64 windowSize
        let ret = Array.init len (fun _ -&gt; -1)
        ret.[windowSize - k - 1] &lt;- (sum / windowSize') |&gt; int

        seq { windowSize .. (len - 1) }
        |&gt; Seq.fold
            (fun sum i -&gt;
                let sum' = sum + (int64 nums.[i]) - (int64 nums.[i - windowSize])
                ret.[i - k] &lt;- (sum' / windowSize') |&gt; int
                sum')
            sum
        |&gt; ignore

        ret
</code></pre>


## URL

[K Radius Subarray Averages - LeetCode](https://leetcode.com/problems/k-radius-subarray-averages/description/)

## Code

[https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/2090/main.fsx](https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/2090/main.fsx)

```plaintext
let getAverage (nums: int[]) (k: int) : int[] =
    let len = Array.length nums
    let windowSize = 2 * k + 1

    if windowSize > len then
        Array.init len (fun _ -> -1)
    else
        let sum = Array.take windowSize nums |> Array.sum |> int64
        let windowSize' = int64 windowSize
        let ret = Array.init len (fun _ -> -1)
        ret.[windowSize - k - 1] <- (sum / windowSize') |> int

        seq { windowSize .. (len - 1) }
        |> Seq.fold
            (fun sum i ->
                let sum' = sum + (int64 nums.[i]) - (int64 nums.[i - windowSize])
                ret.[i - k] <- (sum' / windowSize') |> int
                sum')
            sum
        |> ignore

        ret
```

LeetCode 2090. K Radius Subarray Averages in F#

URL

Code