fd

Author: liwentian

README.md

@@ -296,6 +296,7 @@
 |404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SumOfLeftLeaves.java)|80|
 |406|[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/QueueReconstructionByHeight.java)|60|这题开始没思路，多做几遍|
 |407|[Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/TrappingRainWaterII.java)||
+|408|[Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/validWordAbbreviation.java)|80|多做两遍|
 |409|[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LongestPalindrome.java)||
 |410|[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SplitArrayLargestSum.java)||
 |412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/FizzBuzz.java)|100|

solution/src/main/java/com/inuker/solution/ValidWordAbbreviation.java

@@ -0,0 +1,28 @@
+package com.inuker.solution;
+
+/**
+ * Created by liwentian on 2017/9/6.
+ */
+
+public class ValidWordAbbreviation {
+
+    public boolean validWordAbbreviation(String word, String abbr) {
+        int i = 0, j = 0;
+        for (int value = 0; i < word.length() && j < abbr.length(); ) {
+            if (word.charAt(i) == abbr.charAt(j)) {
+                i++; j++;
+                continue;
+            }
+
+            if (abbr.charAt(j) <= '0' || abbr.charAt(j) > '9') {
+                return false;
+            }
+
+            for (value = 0; j < abbr.length() && abbr.charAt(j) >= '0' && abbr.charAt(j) <= '9'; j++) {
+                value = value * 10 + (abbr.charAt(j) - '0');
+            }
+            i += value;
+        }
+        return i == word.length() && j == abbr.length();
+    }
+}

test/src/main/java/com/example/Main.java

@@ -2,6 +2,7 @@
 
 import com.inuker.solution.FactorCombinations;
 import com.inuker.solution.RestoreIPAddresses;
+import com.inuker.solution.ValidWordAbbreviation;
 import com.leetcode.google.DecodeString;
 import com.leetcode.google.GenerateParentheses;
 import com.leetcode.google.MissingRanges;
@@ -28,14 +29,8 @@
 public class Main {
 
     public static void main(String[] args) {
-        List<List<Integer>> lists = new FactorCombinations().getFactors(128);
-//        List<List<Integer>> lists = new FactorCombinations().getFactors(23848713);
-        for (List<Integer> list : lists) {
-            for (Integer n : list) {
-                System.out.print(n + " ");
-            }
-            System.out.println();
-        }
+        boolean b = new ValidWordAbbreviation().validWordAbbreviation2("a", "01");
+        System.out.println(b);
     }
 }