[LeetCode] 43. Multiply Strings 字符串相乘
Given two non-negative integers num1 and num2represented as strings, return the product of num1 and num2, also represented as a string. Example ...
原文：[LeetCode] 859. Buddy Strings 伙计字符串
Given two strings A and B of lowercase letters, return true if and only if wecan swap two letters in A so that the result equals B . Example : Example : Example : Example : Example : Note: lt A.lengt ...
2019-04-04 23:33 0 1195 推荐指数：
相关推荐
[LeetCode] 415. Add Strings 字符串相加
Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and nu ...
[LeetCode] 205. Isomorphic Strings 同构字符串
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. ...
[LeetCode] Split Concatenated Strings 分割串联字符串
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. ...
[LeetCode] 1247. Minimum Swaps to Make Strings Equal 交换字符使得字符串相同
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 ...
[LeetCode] 893. Groups of Special-Equivalent Strings 特殊字符串的群组
You are given an array `A` of strings. Two strings S and T are special-equivalent if after any number of moves, S == T. A move consists ...
[LeetCode] 271. Encode and Decode Strings 加码解码字符串
Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original ...
LeetCode.1071-字符串最大公约数(Greatest Common Divisor of Strings)
这是小川的第391次更新，第421篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Easy级别的第253题（顺位题号是1071）。对于字符串S和T，当且仅当S = T + ... + T（T与自身连接1次或更多次）时，我们说"T除S"。 返回最大的字符串X，使得X除以str1 ...