For two stringssandt, we say tdividess if and only ifs t ... t tconcatenated with itself or more times Given two strings str and str , return the largest stringxsuch thatxdivides bothstr andstr . Exa ...
2021-03-15 14:08 0 317 推荐指数：
这是小川的第391次更新，第421篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Easy级别的第253题（顺位题号是1071）。对于字符串S和T，当且仅当S = T + ... + T（T与自身连接1次或更多次）时，我们说"T除S"。 返回最大的字符串X，使得X除以str1 ...
Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. ...
Given a list of strings, you could concatenate these strings together into a loop, where for each string you could choose to reverse it or not. ...
Given two non-negative integers num1 and num2represented as strings, return the product of num1 and num2, also represented as a string. Example ...
Given two strings `A` and `B` of lowercase letters, return `true` if and only if we can swap two letters in `A` so that the result equals `B ...
Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and nu ...
Write a function to find the longest common prefix string amongst an array of strings. Hide Tags ...
You are given two strings s1 and s2 of equal length consisting of letters "x" and "y" only. Your task is to make these two strings equal to each ...
