Leetcode 3129. Find All Possible Stable Binary Arrays I

Count how many binary arrays of length zero+one contain exactly zero zeros and one ones and have no run of identical bits longer than limit (equivalently, every subarray longer than limit must contain both 0 and 1). Return the count modulo 10^9+7 (constraints: zero, one, limit ≤ 200).