go on exercise

Sitrone · Sitrone · commit 4d3634b1e623 · 2017-04-14T22:23:17.000+08:00
diff --git a/solutions/500. Keyboard Row/AC_table.java b/solutions/500. Keyboard Row/AC_table.java
@@ -0,0 +1,78 @@
+﻿	/**
+	 * 
+	 * 打表法
+	 *
+	 */
+import java.util.Arrays;
+import java.util.LinkedList;
+import java.util.List;
+
+public class FindWords
+{
+	private static final String first = "qwertyuiopQWERTYUIOP";
+	private static final String second = "asdfghjklASDFGHJKL";
+	private static final String third = "zxcvbnmZXCVBNM";
+
+	public String[] findWords(String[] words)
+	{
+		List<String> list = new LinkedList<>();
+		for (String word : words)
+		{
+			boolean isOneRow = true, isFirst = false, isSecond = false, isThird = false;
+
+			if (first.indexOf(word.charAt(0)) != -1)
+			{
+				isFirst = true;
+			}
+			else if (second.indexOf(word.charAt(0)) != -1)
+			{
+				isSecond = true;
+			}
+			else if (third.indexOf(word.charAt(0)) != -1)
+			{
+				isThird = true;
+			}
+			else
+			{
+				continue;
+			}
+
+			for (char c : word.toCharArray())
+			{
+				if (isFirst)
+				{
+					if(first.indexOf(c) == -1)
+					{
+						isOneRow = false;
+					}
+				}
+				else if (isSecond)
+				{
+					if(second.indexOf(c) == -1)
+					{
+						isOneRow = false;
+					}
+				}
+				else
+				{
+					if(third.indexOf(c) == -1)
+					{
+						isOneRow = false;
+					}
+				}
+			}
+			if(isOneRow)
+			{
+				list.add(word);
+			}
+		}
+		return list.toArray(new String[list.size()]);
+	}
+	
+	public static void main(String[] args)
+	{
+		FindWords f = new FindWords();
+		String[] arr = new String[]{"Hello", "Alaska", "Dad", "Peace"};
+		System.out.println(Arrays.toString(f.findWords(arr)));
+	}
+}
diff --git a/solutions/537. Complex Number Multiplication/AC_String op.java b/solutions/537. Complex Number Multiplication/AC_String op.java
@@ -0,0 +1,26 @@
+﻿	/**
+	 * 
+	 * 
+	 *
+	 */
+public class Solution {
+    public String complexNumberMultiply(String a, String b) {
+		int x1, x2, y1, y2;
+		String[] A = a.split("\\+");
+		String[] B = b.split("\\+");
+		
+		x1 = Integer.valueOf(A[0]);
+		x2 = Integer.valueOf(B[0]);
+		y1 = Integer.valueOf(A[1].replace("i", ""));
+		y2 = Integer.valueOf(B[1].replace("i", ""));
+		
+		int x1x2 = x1 * x2;
+		int y1y2 = y1 * y2;
+		int x1y2y1x2 = x1 * y2 + x2 * y1;
+		
+		String xfinal = x1x2 -y1y2 + "";
+		String yfinal = x1y2y1x2 + "i";
+		String res = xfinal + "+" + yfinal;
+		return res;
+    }
+}
diff --git a/solutions/540. Single Element in a Sorted Array/AC_bit man.java b/solutions/540. Single Element in a Sorted Array/AC_bit man.java
@@ -0,0 +1,19 @@
+﻿	/**
+	 * 
+	 * 
+	 *
+	 */
+public class Solution {
+    public int singleNonDuplicate(int[] nums) {
+        if (nums.length == 0)
+		{
+			return 0;
+		}
+		int res = nums[0];
+		for (int i = 1; i < nums.length; i++)
+		{
+			res ^= nums[i];
+		}
+		return res;
+    }
+}
diff --git a/solutions/557. Reverse Words in a String III/AC_.java b/solutions/557. Reverse Words in a String III/AC_.java
@@ -0,0 +1,27 @@
+﻿	/**
+	 * 
+	 * 
+	 *
+	 */
+public class Solution {
+	public String reverseWords(String s)
+	{
+		if (s == null || s.isEmpty())
+		{
+			return "";
+		}
+		String[] strs = s.split(" ");
+		StringBuilder sb = new StringBuilder(s.length());
+		for (int i = 0; i < strs.length; i++)
+		{
+			sb.append(reverseWord(strs[i])).append(" ");
+		}
+		return sb.toString().trim();
+	}
+
+	private String reverseWord(String s)
+	{
+		StringBuilder sb = new StringBuilder(s.length());
+		return sb.append(s).reverse().toString();
+	}
+}
