倒四合天的博客

public String[] uncommonFromSentences(String A, String B) { Map<String, Integer> savemap = new HashMap<>(); List<String> list = new ArrayList<>(); saveS...

/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { pub...

class Solution { public String toLowerCase(String str) { if (str.isEmpty()) { return null; } byte[] num = str.getBytes(); for (int i = 0; i < num.le...

class Solution { public int hammingDistance(int x, int y) { int sum=x^y; int count; for(count=0;sum>0;count++){ sum&=sum-1; } return cou...

public int uniqueMorseRepresentations(String[] words) { String[] numberstr = new String[]{".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", &

public static boolean isAnagram(String s, String t) { if (s.equals(t)) { return true; } else if (null == s || null == t || s.length() != t.length() || s.length() <= 0) ...

public int[] twoSum(int[] nums, int target) { List<Integer> list = new ArrayList<>(); Boolean issum = checknum(nums, target, list, 0, false); if (issum) { ...

private static boolean isPalindrome(String s) { if(null==s||s.length()<2){//如果字符串的长度小于2，直接返回true return true; } int size=s.length()-1;//记载的总长度 char lef...

​public static boolean validPalindrome(String s) { if (s.length() <= 2) {//如果字符串长度小于等于2，直接返回true return true; } return checkResult(s, 0, s.length() - 1, 1);}private static...

public static int numJewelsInStones(String J, String S) { int result = 0; for (int i = 0; i < S.length(); i++) { for (int j = 0; j < J.length(); j++) { ...