leetcode 686 Repeated String Match
2017-10-20 19:39
375 查看
class Solution { public int repeatedStringMatch(String A, String B) { int count = 0; StringBuilder sb = new StringBuilder(); while (sb.length() < B.length()) { sb.append(A); count++; } if(sb.toString().contains(B)) return count;//java.lang.String.contains() 方法返回true,当且仅当此字符串包含指定的char值序列 if(sb.append(A).toString().contains(B)) return ++count;//toString() 方法可把一个逻辑值转换为字符串,并返回结果。 return -1; } }
相关文章推荐
- leetcode 686 Repeated String Match
- Leetcode挑战题——Repeated String Match
- LeetCode Repeated String Match
- [LeetCode] Repeated String Match 重复字符串匹配
- Leetcode | Repeated String Match
- LeetCode Weekly Contest 52 Repeated String Match(string)
- LeetCode -- Google -- Interview Process. 1. Repeated String Match(java)
- String-686-Repeated String Match
- Repeated String Match
- Repeated String Match问题及解法
- leetcode 151 Reverse Words in a String
- Leetcode | Interleaving String
- 【Leetcode】Reverse Words in a String
- [LeetCode]-008-String to Integer (atoi)
- [LeetCode] Reverse Words in a String
- leetcode:String to Integer (atoi)
- leetcode 8:String to integer(atoi)
- 【leetcode】String——Word Ladder II(126)
- Leetcode - 557. Reverse Words in a String III (C++) stringstream
- 【leetcode】String——Palindrome Pairs(336)