<h2 id="heading-url">URL</h2>
<a target="_blank" href="https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/description/?envType=daily-question&amp;envId=2023-11-15">Maximum Element After Decreasing and Rearranging - LeetCode</a>
<h2 id="heading-code">Code</h2>
<a target="_blank" href="https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1846/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1846/main.fsx</a>
<pre><code class="lang-fsharp">let maximumElementAfterDecrementingAndRearranging (arr: int list) : int =
 let rec f arr prev =
 match arr with
 | [] -&gt; prev
 | h :: t -&gt; if h - prev &gt; 1 then f t (prev + 1) else f t h

 let arr' = List.sort arr
 f (List.tail arr') 1
</code></pre>

## URL

[Maximum Element After Decreasing and Rearranging - LeetCode](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/description/?envType=daily-question&envId=2023-11-15)

## Code

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

```fsharp
let maximumElementAfterDecrementingAndRearranging (arr: int list) : int =
    let rec f arr prev =
        match arr with
        | [] -> prev
        | h :: t -> if h - prev > 1 then f t (prev + 1) else f t h

    let arr' = List.sort arr
    f (List.tail arr') 1
```

Shohei Yoshida's Blog

Shohei Yoshida's Blog

LeetCode 1846. Maximum Element After Decreasing and Rearranging in F#

URL

Code