MCPcopy
hub / github.com/HuberTRoy/leetCode / MaxASubarrayLessThanMinBSubarray.py

File MaxASubarrayLessThanMinBSubarray.py

DP/MaxASubarrayLessThanMinBSubarray.py:None–None  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1"""
2今日头条笔试第四题：
3给两个长度为n的数组，a,b。
4求有多少个 [l,r]，其中max(a[l:r])<min(b[l:r])。

Callers

nothing calls this directly

Calls 1

maxALEminBFunction · 0.85

Tested by

no test coverage detected