James Pan

原题网址：https://leetcode.com/problems/fraction-to-recurring-decimal/Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.If the frac

原题网址：https://leetcode.com/problems/length-of-last-word/Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.

原题网址：https://leetcode.com/problems/valid-number/Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote:

原题网址：https://leetcode.com/problems/edit-distance/Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)Y

原题网址：https://leetcode.com/problems/restore-ip-addresses/Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "2552551

原题网址：https://leetcode.com/problems/simplify-path/Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"

原题网址：https://leetcode.com/problems/text-justification/Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified

原题网址：https://leetcode.com/problems/roman-to-integer/Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.方法：理解罗马数字。public class Solut

原题网址：https://leetcode.com/problems/compare-version-numbers/Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0

原题网址：https://leetcode.com/problems/validate-ip-address/方法：扫描检查，代码写得比较丑陋，暂时凑合着。public class Solution { private static final String NEITHER = "Neither"; private static final String IPV4 = "I