weixin_63994459的博客

参考代码：class Solution { public String removeDuplicateLetters(String s) { Stack<Character> stack = new Stack<>(); //数组seen记录当前栈中已经存在的字符，如果后续再遇到可以直接跳过 boolean[] seen = new boolean[26]; //last_occurrence 记录字符串中

参考代码：class Solution { public int nthSuperUglyNumber(int n, int[] primes) { int[] dp=new int[n]; dp[0]=1; int[] index=new int[primes.length]; for(int i=1;i<n;i++){ int min=Integer.MAX_VALUE;

参考代码：class Solution { public int maxProfit(int[] prices) { int n=prices.length; if(n==0)return 0; int[] hold=new int[n]; hold[0]=-prices[0]; int[] notHold=new int[n]; for(int i=1;i<n;i++){

参考代码： class Solution{public int[] countBits(int num) { int[] res = new int[num + 1]; for(int i = 1;i<= num;i++){ //注意要从1开始，0不满足 res[i] = res[i & (i - 1)] + 1; } return res; }}大致思路：找到数组中当前的i的二

方法一：动态规划参考代码：class Solution { public int lengthOfLIS(int[] nums) { if(nums.length == 0) return 0; int[] dp = new int[nums.length]; int res = 0; Arrays.fill(dp, 1); for(int i = 0; i < nums.length; i++) {

参考代码：class Solution { public String getHint(String secret, String guess) { int[] nums = new int[10]; int m=0,n=0; for(int i=0;i<guess.length();i++){ if(secret.charAt(i)==guess.charAt(i)){ m++;

参考代码：class Solution { public boolean canWinNim(int n) { if(n%4==0){ return false; } return true; }}大致思路：先自己判断一下5、6、7、8是true还是false，会发现8那里是false，在自己推理的过程中就会发现，凡是碰到4的倍数，先手的一定会输，你拿N根对手就会拿4-N根，保证每回合共减4根，你永远是4

参考代码：class Solution { public boolean wordPattern(String pattern, String s) { String[] words = s.split(" "); if (words.length != pattern.length()) { return false; } Map<Object, Integer> map = new Hash

参考代码：class Solution { public int findDuplicate(int[] nums) { int len = nums.length; int left = 1; int right = len - 1; while (left < right) { int mid = left + (right - left) / 2;

参考代码： public void moveZeroes(int[] nums) { if (nums == null || nums.length <= 1) { return; } int index = 0; for (int i = 0; i < nums.length; i++) { if (nums[i] != 0) { nums[in

参考代码：class Solution { public int numSquares(int n) { while(n % 4 == 0) n /= 4; if(n % 8 == 7) return 4; for(int i = 0; i * i <= n; ++i) { if(n - i * i == 0) return 1; } for(int i = 0; i * i

参考代码： public class Solution extends VersionControl { public int firstBadVersion(int n) { int lo = 1; int hi = n; while(lo < hi) { int mid = lo + (hi - lo) / 2; if (isBadVersion(mid)) {

参考代码：class Solution { public int hIndex(int[] citations) { Arrays.sort(citations); int h = 0, i = citations.length - 1; while (i >= 0 && citations[i] > h) { h++; i--; }

参考代码：class Solution { public int missingNumber(int[] nums) { int res = nums.length; for(int i = 0; i < nums.length; i++){ res ^= nums[i] ^ i; } return res; }}大致思路：由位运算符中异或的性质：0 ^ 4 = 4 4 ^ 4

参考代码：class Solution { public int nthUglyNumber(int n) { int n2 = 0,n3 = 0,n5 = 0; int[] dp = new int[n]; dp[0] = 1; for(int i = 1;i<n;i++){ dp[i] = Math.min(2*dp[n2],Math.min(3*dp[n3],5*dp[n5]));

参考代码：class Solution { public boolean isUgly(int n) { if(n==1){ return true; } if(n<=0){ return false; } while (n%5==0){ n/=5; } while (n%3==0){

参考代码：class Solution { public int[] singleNumber(int[] nums) { int xor = 0; for (int num : nums) { xor ^= num; } int mask = xor & (-xor); int[] ans = new int[2]; for (int num : nu

参考代码：class Solution { public int addDigits(int num) { if(num==0){ return 0; } while(num>=10){ int sum=0; while(num>0){ int a=num%10; num=num/10;

参考代码：class Solution { private List<String>res=new ArrayList<>(); public List<String> binaryTreePaths(TreeNode root) { dfs(root,new StringBuilder()); return res; } private void dfs(TreeNode root,Str

参考代码：class Solution { public boolean isAnagram(String s, String t) { int[] count = new int[26]; for(int i = 0; i < s.length(); i++){ count[s.charAt(i) - 'a']++; } for(int i = 0; i < t.length(); i++){

参考代码：class Solution { public boolean searchMatrix(int[][] matrix, int target) { if (matrix == null || matrix.length == 0) return false; int m = 0; int n = matrix[0].length - 1; while (m < matrix.length && n

参考代码：class Solution { public int[] productExceptSelf(int[] nums) { if (nums == null || nums.length == 0) { return new int[0]; } int len = nums.length; int[] res = new int[len]; int left =

参考代码：class Solution { public void deleteNode(ListNode node) { node.val=node.next.val; node.next=node.next.next; }}一般的删除节点我们可以用head->next->val去判断下一个是否是删除的节点，然后head->next=head->next->next，而此题中node就是我们需要删除的节点，所以我们可

参考代码：class Solution { public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { if (root == null) { return root; } if (root == p || root == q) { return root; } TreeN

参考代码：class Solution { public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { while (true) { if (root.val > p.val && root.val > q.val) { root = root.left; } else if

参考代码：class Solution { public boolean isPalindrome(ListNode head) { if (head.next == null){ return true; } ListNode slow = head; ListNode fast = head.next; while (fast.next != null && fast.n

参考代码：class Solution { public boolean isPowerOfTwo(int n) { if(n < 1 ){ return false; } while(n % 2 == 0){ n /= 2; } return n == 1; }}主要是分几种情况，首先小于1的不可能为2的幂。然后是大于一的：第一种能整除2的，

参考代码：class Solution { public List<String> summaryRanges(int[] nums) { List<String> ans = new ArrayList<String>(); int numsLen = nums.length; int front = 0; while(front < numsLen) { StringBuilder sb = new S

参考代码：public class Solution { // you need to treat n as an unsigned value public int hammingWeight(int n) { int a=0; int count=0; for(int i=0;i<32;i++){ a=n&1; if(a==1){ count

参考代码：public class Solution { public int reverseBits(int n) { int ret = 0; int count = 32; while (count-- > 0) { int lastBit = n & 1; ret = ret << 1 | lastBit; n = n >>

参考代码：public int titleToNumber(String s) { char[] charArray = s.toCharArray(); int res = 0; for(int i = 0; i < charArray.length; i++) { res = res*26 + (charArray[i] - 'A' + 1); } return res;

参考代码：class Solution{public int majorityElement(int[] nums) { int count = 1; int maj = nums[0]; for (int i = 1; i < nums.length; i++) { if (maj == nums[i]) count++; else { count--; if (count == 0) { maj = nums[i + 1];

参考代码：class Solution { public string convertToTitle(int columnNumber) { string result; while(columnNumber>0) { int current=(columnNumber-1)%26; columnNumber=(columnNumber-1)/26; char c

参考代码：class Solution { public int[] twoSum(int[] numbers, int target) { for (int i = 0, j = numbers.length - 1; i < j;) { int sum = numbers[i] + numbers[j]; if (sum == target) return new int[] {i + 1, j + 1};

参考代码：class MinStack { private Stack<Integer> stack; private Stack<Integer> min_stack; public MinStack() { stack = new Stack<>(); min_stack = new Stack<>(); } public void push(int x) { s

参考代码：class Solution { public List<Integer> postorderTraversal(TreeNode root) { List<Integer> res = new ArrayList<Integer>(); if (root == null) { return res; } Deque<TreeNode> stack

参考代码：class Solution { public List<Integer> preorderTraversal(TreeNode root) { List<Integer> res = new ArrayList<>(); Stack<TreeNode> stack = new Stack<>(); while (root != null || !stack.isEmpty()

参考代码：public class Solution { public boolean hasCycle(ListNode head) { ListNode fast=head; ListNode slow=head; while(fast!=null&&fast.next!=null){ fast = fast.next.next; slow=slow.next;

参考代码：class Solution { public int singleNumber(int[] nums) { int res = 0; for (int num : nums) { res = res ^ num; } return res; }}位运算，每个元素依次异或。i ^ 0 = i;i ^ i = 0;且异或满足交换律和结合律。所有依次异或最终留下的即

参考代码：class Solution { public boolean isPalindrome(String s) { char[] w=s.toCharArray(); int i=0;int j=w.length-1; for(int k=0;k<w.length;k++){ if(w[k]>='A'&&w[k]<='Z'){ w[k]=(char)