You are given a binary string s. Return the number of substrings with dominant ones. A string has dominant ones if the number of ones in the string is greater than or equal to the square of the number of zeros in the string.   Example 1: Input: s = "00011"…

一个 平方和三元组 (a,b,c) 指的是满足 a2 + b2 = c2 的 整数 三元组 a，b 和 c 。 给你一个整数 n ，请你返回满足 1 <= a, b, c <= n 的 平方和三元组 的数目。   示例 1： 输入：n = 5 输出：2 解释：平方和三元组为 (3,4,5) 和 (4,3,5) 。 示例 2： 输入：n = 10 输出：4 解释：平方和三元组为 (3,4,5)，(4,3,5)，(6,8,10) 和 (8,6,10) 。   提示：

A square triple (a,b,c) is a triple where a, b, and c are integers and a2 + b2 = c2. Given an integer n, return the number of square triples such that 1 <= a, b, c <= n.   Example 1: Input: n = 5 Output: 2 Explanation: The square triples are (3,4,5) and (4…