10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/cb0f98aea04386f6.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/cb0f98aea04386f6.js"],"default"] 12:T540,class Solution { public String generateString(String str1, String str2) { int n = str1.length(), m = str2.length(); char[] s = new char[n + m - 1]; boolean[] fixed = new boolean[n + m - 1]; for (int i = 0; i < s.length; i++) s[i] = 'a'; for (int i = 0; i < n; i++) { if (str1.charAt(i) == 'T') { for (int j = 0; j < m; j++) { int pos = i + j; if (fixed[pos] && s[pos] != str2.charAt(j)) return ""; s[pos] = str2.charAt(j); fixed[pos] = true; } } } for (int i = 0; i < n; i++) { if (str1.charAt(i) == 'F') { boolean diff = false; for (int j = 0; j < m; j++) { if (s[i + j] != str2.charAt(j)) { diff = true; break; } } if (diff) continue; boolean changed = false; for (int j = m - 1; j >= 0; j--) { int pos = i + j; if (!fixed[pos]) { s[pos] = 'b'; changed = true; break; } } if (!changed) return ""; } } return new String(s); } }13:T4cc,class Solution { public: string generateString(string str1, string str2) { int n = str1.length(), m = str2.length(); string s(n + m - 1, 'a'); vector fixed(n + m - 1, false); for (int i = 0; i < n; ++i) { if (str1[i] == 'T') { for (int j = 0; j < m; ++j) { int pos = i + j; if (fixed[pos] && s[pos] != str2[j]) return ""; s[pos] = str2[j]; fixed[pos] = true; } } } for (int i = 0; i < n; ++i) { if (str1[i] == 'F') { bool diff = false; for (int j = 0; j < m; ++j) { if (s[i + j] != str2[j]) { diff = true; break; } } if (diff) continue; bool changed = false; for (int j = m - 1; j >= 0; --j) { int pos = i + j; if (!fixed[pos]) { s[pos] = 'b'; changed = true; break; } } if (!changed) return ""; } } return s; } };14:T442,/** * @param {string} str1 * @param {string} str2 * @return {string} */ var generateString = function(str1, str2) { const n = str1.length, m = str2.length; let s = new Array(n + m - 1).fill('a'); let fixed = new Array(n + m - 1).fill(false); for (let i = 0; i < n; i++) { if (str1[i] === 'T') { for (let j = 0; j < m; j++) { let pos = i + j; if (fixed[pos] && s[pos] !== str2[j]) return ""; s[pos] = str2[j]; fixed[pos] = true; } } } for (let i = 0; i < n; i++) { if (str1[i] === 'F') { let diff = false; for (let j = 0; j < m; j++) { if (s[i + j] !== str2[j]) { diff = true; break; } } if (diff) continue; let changed = false; for (let j = m - 1; j >= 0; j--) { let pos = i + j; if (!fixed[pos]) { s[pos] = 'b'; changed = true; break; } } if (!changed) return ""; } } return s.join(''); };

Time Complexity

Space Complexity