String
文章平均质量分 74
再见小小ronnie
这个作者很懒,什么都没留下…
展开
-
Leetcode 14. Longest Common Prefix
public class Solution { public String longestCommonPrefix(String[] strs) { if (strs == null || strs.length == 0) return new String(); int len = 0; for (int i=0; i<strs[0].l原创 2017-02-01 03:10:25 · 149 阅读 · 0 评论 -
Leetcode 434. Number of Segments in a String
public class Solution { public int countSegments(String s) { int ret = 0; // count number of segment instead of space char[] arr = s.toCharArray(); for (int i=0; i<原创 2017-02-01 03:41:14 · 170 阅读 · 0 评论 -
Leetcode 20. Valid Parentheses
public class Solution { public boolean isValid(String s) { Stack stack = new Stack<>(); for (int i=0; i<s.length(); i++) { char tmp = s.charAt(i); if (!stac原创 2017-02-01 04:10:44 · 148 阅读 · 0 评论 -
Leetcode 459. Repeated Substring Pattern
/* if there are some repeated patterns in the string, * then the length of a pattern can be divided by the length of the string * and the quotient is the number of times the pattern exists in the s原创 2017-02-01 05:31:55 · 190 阅读 · 0 评论 -
Leetcode 58. Length of Last Word
public class Solution { public int lengthOfLastWord(String s) { int ret = 0; for (int i=s.length()-1; i>=0; i--) { if (s.charAt(i) == ' ') continue; ret++;原创 2017-02-01 06:11:15 · 149 阅读 · 0 评论 -
Leetcode 12. Integer to Roman
public class Solution { public static String intToRoman(int num) { String M[] = {"", "M", "MM", "MMM"}; String C[] = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"};转载 2017-02-01 12:02:52 · 145 阅读 · 0 评论 -
Leetcode 5. Longest Palindromic Substring
/** * for string c1c2c3c4 ... cn, * check every substring of the string, * substrings may start from c1, c2, c3, ... respectively */ public class Solution { public String longestPalindrome(St原创 2017-02-02 11:47:10 · 162 阅读 · 0 评论 -
Leetcode 151. Reverse Words in a String
public class Solution { public String reverseWords(String s) { if (s == null || s.length() == 0) return ""; StringBuilder str = new StringBuilder(s); StringBuilder原创 2017-02-03 03:09:47 · 166 阅读 · 0 评论 -
Leetcode 43. Multiply Strings
public class Solution { public String multiply(String num1, String num2) { int m = num1.length(), n = num2.length(); int[] pos = new int[m + n]; for(int i = m - 1;转载 2017-02-03 06:16:47 · 163 阅读 · 0 评论