10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T4b6,class Solution { static long[] pow10 = new long[100001]; static int MOD = 1000000007; static { pow10[0] = 1; for (int i = 1; i <= 100000; i++) { pow10[i] = (pow10[i - 1] * 10) % MOD; } } public int[] sumAndMultiply(String s, int[][] queries) { int n = s.length(); long[] sum = new long[n + 1]; long[] x = new long[n + 1]; int[] cnt = new int[n + 1]; for (int i = 0; i < n; i++) { int d = s.charAt(i) - '0'; sum[i + 1] = sum[i] + d; cnt[i + 1] = cnt[i] + (d > 0 ? 1 : 0); if (d > 0) { x[i + 1] = (x[i] * 10 + d) % MOD; } else { x[i + 1] = x[i]; } } int m = queries.length; int[] res = new int[m]; for (int i = 0; i < m; i++) { int l = queries[i][0]; int r = queries[i][1] + 1; int length = cnt[r] - cnt[l]; long curX = (x[r] - (x[l] * pow10[length]) % MOD + MOD) % MOD; long curSum = (sum[r] - sum[l]) % MOD; res[i] = (int)((curX * curSum) % MOD); } return res; } }13:T4cf,const int MOD = 1e9 + 7; vector pow10_arr; auto init = []() { pow10_arr.assign(100001, 1); for (int i = 1; i <= 100000; ++i) { pow10_arr[i] = (pow10_arr[i - 1] * 10) % MOD; } return 0; }(); class Solution { public: vector sumAndMultiply(string s, vector>& queries) { int n = s.length(); vector sum(n + 1, 0); vector x(n + 1, 0); vector cnt(n + 1, 0); for (int i = 0; i < n; ++i) { int d = s[i] - '0'; sum[i + 1] = sum[i] + d; cnt[i + 1] = cnt[i] + (d > 0); if (d > 0) { x[i + 1] = (x[i] * 10 + d) % MOD; } else { x[i + 1] = x[i]; } } int m = queries.size(); vector res(m); for (int i = 0; i < m; ++i) { int l = queries[i][0]; int r = queries[i][1] + 1; int len = cnt[r] - cnt[l]; long long curX = (x[r] - (x[l] * pow10_arr[len]) % MOD + MOD) % MOD; long long curSum = (sum[r] - sum[l]) % MOD; res[i] = (curX * curSum) % MOD; } return res; } };14:T47c,const MOD = 1000000007n; const pow10 = new BigInt64Array(100001); pow10[0] = 1n; for (let i = 1; i <= 100000; i++) { pow10[i] = (pow10[i - 1] * 10n) % MOD; } /** * @param {string} s * @param {number[][]} queries * @return {number[]} */ var sumAndMultiply = function(s, queries) { const n = s.length; const sum = new BigInt64Array(n + 1); const x = new BigInt64Array(n + 1); const cnt = new Int32Array(n + 1); for (let i = 0; i < n; i++) { const d = BigInt(s[i]); const dNum = Number(s[i]); sum[i + 1] = sum[i] + d; cnt[i + 1] = cnt[i] + (dNum > 0 ? 1 : 0); if (dNum > 0) { x[i + 1] = (x[i] * 10n + d) % MOD; } else { x[i + 1] = x[i]; } } const m = queries.length; const res = new Array(m); for (let i = 0; i < m; i++) { const l = queries[i][0]; const r = queries[i][1] + 1; const len = cnt[r] - cnt[l]; let curX = (x[r] - (x[l] * pow10[len]) % MOD + MOD) % MOD; let curSum = sum[r] - sum[l]; res[i] = Number((curX * curSum) % MOD); } return res; };

Time Complexity

Space Complexity