String
liujunlovecs
这个作者很懒,什么都没留下…
展开
-
Interleaving String
public class Solution { public boolean isInterleave(String s1, String s2, String s3) { if (s1 == null || s2 == null || s3 == null) { return false; } in原创 2015-08-07 20:02:44 · 216 阅读 · 0 评论 -
Leetcode#30||Substring with Concatenation of All Words
public class Solution { public List findSubstring(String s, String[] words) { List result = new ArrayList(); if (s == null || s.length() == 0 || words.length == 0) {原创 2015-08-13 10:20:27 · 198 阅读 · 0 评论 -
Leetcode#43||Multiply Strings
public class Solution { public String multiply(String num1, String num2) { String s1 = new StringBuilder(num1).reverse().toString(); String s2 = new StringBuilder(num2).reverse().t原创 2015-08-15 17:02:31 · 244 阅读 · 0 评论 -
Leetcode#32||Longest Valid Parentheses
public class Solution { public int longestValidParentheses(String s) { if (s == null || s.length() < 2) { return 0; } int len = s.length(); int原创 2015-08-14 16:28:28 · 272 阅读 · 0 评论 -
Leetocde#38||Count and Say
public class Solution { public String countAndSay(int n) { if (n < 1) { return null; } String result = "1"; int t = n; while (原创 2015-08-15 08:17:34 · 205 阅读 · 0 评论 -
edit distance
public class Solution { public int minDistance(String word1, String word2) { int len1 = word1.length(); int len2 = word2.length(); int[][] f = new int[len1 + 1][le原创 2015-08-04 18:11:13 · 250 阅读 · 0 评论 -
Leetcode#49||Group Anagrams
public class Solution { public List> groupAnagrams(String[] strs) { List> result = new ArrayList>(); if (strs == null || strs.length == 0) { return result;原创 2015-08-17 10:04:32 · 207 阅读 · 0 评论 -
Leetcode#58||Length of Last Word
public class Solution { public int lengthOfLastWord(String s) { if (s == null || s.length() == 0) { return 0; } int result = 0; char[]原创 2015-08-17 15:50:54 · 262 阅读 · 0 评论 -
Leetcode#65||Valid Number
public class Solution { public boolean isNumber(String s) { int length = s.length(); int i = 0; int e = length - 1; while (i < length && Character原创 2015-08-18 14:47:35 · 365 阅读 · 0 评论 -
Leetcode#67||Add Binary
public class Solution { public String addBinary(String a, String b) { if (a.length() < b.length()) { String temp = a; a = b; b = temp; }原创 2015-08-18 15:20:34 · 263 阅读 · 0 评论 -
Leetcode#72||Edit Distance
public class Solution { public int minDistance(String word1, String word2) { int m = word1.length(); int n = word2.length(); int[][] dist = new int[m + 1][n + 1];原创 2015-08-18 18:05:44 · 247 阅读 · 0 评论 -
Leetcode#28||Implement strStr()
public class Solution { public int strStr(String haystack, String needle) { if (haystack == null || haystack.length() < needle.length()) { return -1; }原创 2015-08-13 07:25:07 · 248 阅读 · 0 评论 -
Leetcode#20||Valid Parentheses
public class Solution { public boolean isValid(String s) { Map map = new HashMap(); map.put('(', ')'); map.put('[', ']'); map.put('{', '}'); Stack原创 2015-08-12 12:28:51 · 236 阅读 · 0 评论 -
Leetcode#22||Generate Parentheses
public class Solution { public List generateParenthesis(int n) { List result = new ArrayList(); if (n <= 0) { return result; } dfs(res原创 2015-08-12 15:59:42 · 271 阅读 · 0 评论 -
Longest Valid Parentheses
public class Solution { public int longestValidParentheses(String s) { if (s == null || s.length() < 2) { return 0; } int length = s.length();原创 2015-08-07 19:29:55 · 206 阅读 · 0 评论 -
Palindrome Partitioning II
public class Solution { public int minCut(String s) { if (s == null || s.length() == 0) { return 0; } int length = s.length(); boolean原创 2015-08-08 07:45:57 · 218 阅读 · 0 评论 -
Leetcode#3||Longest Substring Without Repeating Characters
Using HashSet.public class Solution { public int lengthOfLongestSubstring(String s) { if (s == null || s.length() == 0) { return 0; } Set set = new H原创 2015-08-11 10:07:16 · 246 阅读 · 0 评论 -
Leetcode#5||Longest Palindromic Substring
TBC原创 2015-08-11 10:46:19 · 189 阅读 · 0 评论 -
Leetcode#12||Integer to Roman
public class Solution { public String intToRoman(int num) { if (num < 0) { return ""; } int[] values = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5,原创 2015-08-11 16:42:58 · 218 阅读 · 0 评论 -
Leetcode#6||Zigzag Conversion
public class Solution { public String convert(String s, int numRows) { if (numRows == 1 || s.length() <= numRows) { return s; } StringBuilder sb = new原创 2015-08-11 12:01:47 · 214 阅读 · 0 评论 -
Leetcode#8||String to Integer (atoi)
public class Solution { public int myAtoi(String str) { if (str == null || str.length() == 0) { return 0; } // trim the whitespace str = str.trim();原创 2015-08-11 14:35:11 · 357 阅读 · 0 评论 -
Leetcode#13||Roman to Integer
public class Solution { public int romanToInt(String s) { if (s == null || s.length() == 0) { return 0; } Map map = new HashMap(); map.put('I',原创 2015-08-11 16:52:20 · 214 阅读 · 0 评论 -
Leetcode#14||Longest Common Prefix
public class Solution { public String longestCommonPrefix(String[] strs) { if (strs == null || strs.length == 0) { return ""; } int minLen = Integer.MA原创 2015-08-11 17:14:26 · 212 阅读 · 0 评论 -
Leetcode#17||Letter Combinations of a Phone Number
public class Solution { public List letterCombinations(String digits) { List result = new ArrayList(); if (digits == null || digits.length() == 0) { return res原创 2015-08-12 11:31:46 · 286 阅读 · 0 评论 -
Leetcode#76||Minimum Window Substring
public class Solution { public String minWindow(String s, String t) { String result = ""; if (s == null || t == null || s.length() < t.length()) { return resul原创 2015-08-19 16:51:15 · 332 阅读 · 0 评论