liujunlovecs的专栏

public class Solution { public int romanToInt(String s) { if (s == null || s.length() == 0) { return 0; } Map map = new HashMap(); map.put('I',

public class Solution { public int mySqrt(int x) { if (x < 0) { return -1; } int left = 1; int right = x; while (left <= right

public class Solution { public String getPermutation(int n, int k) { StringBuilder result = new StringBuilder(); List list = new ArrayList(); int factorial = 1;

public class Solution { public String addBinary(String a, String b) { if (a.length() < b.length()) { String temp = a; a = b; b = temp; }

public class Solution { public boolean isNumber(String s) { int length = s.length(); int i = 0; int e = length - 1; while (i < length && Character

public class Solution { public double myPow(double x, int n) { if (n < 0) { return 1 / pow(x, -n); } else { return pow(x, n); } }

public class Solution { public String multiply(String num1, String num2) { String s1 = new StringBuilder(num1).reverse().toString(); String s2 = new StringBuilder(num2).reverse().t

public class Solution { public int divide(int dividend, int divisor) { if (divisor == 0) { return Integer.MAX_VALUE; } if (divisor == -1 && dividend == Integer.

public class Solution { public boolean isPalindrome(int x) { if (x < 0) { return false; } int divisor = 1; while (x / divisor >= 10) {

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,

Java中取余数： (结果与被除数同号)     1、  5 %  3 =  2；     2、 -5 %  3 = -2；     3、  5 % -3 =  2；     4、 -5 % -3 = -2； public class Solution { public int reverse(int x) { int reverse = 0;

public class Solution { public String convert(String s, int numRows) { if (numRows == 1 || s.length() <= numRows) { return s; } StringBuilder sb = new

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { public ListNode addT

public class Solution { public int[] plusOne(int[] digits) { if (digits == null || digits.length == 0) { return digits; } int carry = 1;