cgfankai的博客

public class Solution { private final static Set occupiedCols = new HashSet(); private final static Set occupiedDiag1s = new HashSet(); private final static Set occupiedDiag2s = new HashSet();

public class Solution { public int maxProduct(String[] words) { int max = 0 ; int[] masks = new int[words.length]; for (int i = 0; i < masks.length; i++) { for (char c :

public class Solution { public int missingNumber(int[] nums) { int[] copy = new int[nums.length+1]; copy[0] = 1; for (int i = 0; i < nums.length; i++) { copy[nums[i]] =

public class Solution { public int majorityElement(int[] nums) { HashMap elementNum = new HashMap(nums.length/2); for (int element : nums) { if (elementNum.containsKey(element

解法一：public class Solution { public boolean containsDuplicate(int[] nums) { HashSet hasSet = new HashSet<>(); for (int i = 0; i < nums.length; i++) { if (hasSet.contains(nums[i

public class Solution { public int titleToNumber(String s) { String _27String = s.toLowerCase(); int res = 0; for (int i = 0; i < _27String.length(); i++) { res = (i

解法一： public class Solution { public int maxProfit(int[] prices) { if (prices.length<2) return 0; int sumProfit = 0,startIndex = 0; for (int i = 1; i < prices.length; i++) {

解法一： public class Solution { public int[] productExceptSelf(int[] nums) { int product=1,zeroNum = 0; int res[] = new int[nums.length]; for (int i : nums) { if (i!=0) { product*=

解法一： public class solution { public boolean isSameTree(TreeNode p, TreeNode q) { if (p==null&&q==null) { return true; } if (p==null&&q!=null) { return f

解法一： public class Solution { public int[] singleNumber(int[] nums) { int[] copyNum = new int[nums.length]; LinkedList list = new LinkedList(); for (int i : nums) { if (list.cont

解法一：public void moveZeroes(int[] nums) { if (nums.length==1) { return; } int zeroNum=0; for (int i = 0; i < nums.length-zeroNum; i++) { if (nums[i]==0) { for (int j =

解法一： public TreeNode invertTree(TreeNode root) { ArrayDeque queue = new ArrayDeque(); queue.add(root); while (!queue.isEmpty()) { TreeNode temp1 = queue.pollFirst(); TreeNode temp2 = t

public void deleteNode(ListNode node) { node.val = node.next.val; node.next=node.next.next; }

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

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