maozezhong0的博客

题目：https://leetcode.com/problems/symmetric-tree/代码：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int

题目：https://leetcode.com/problems/plus-one/题意: 给定数组a[],从a[0]到a[length-1]是一个数的各位的数字，比如19,则a[0]=1,a[1]=0。让你求这个数字加一所得的各位数的数组.代码：public class Solution { public int[] plusOne(int[] digits) { int

题目：https://leetcode.com/problems/remove-duplicates-from-sorted-array/代码：public class Solution { public int removeDuplicates(int[] nums) { if(nums.length==0) return 0; in

题目：https://leetcode.com/problems/pascals-triangle/代码：public class Solution { public List<List<Integer>> generate(int numRows) { List<List<Integer>> res = new ArrayList<>(); ArrayLis

题目：https://leetcode.com/problems/power-of-four/代码：public class Solution { public boolean isPowerOfFour(int num) { if(num==1) return true; if(num<4) return fa

题目：https://leetcode.com/problems/implement-queue-using-stacks/代码：class MyQueue { Queue<Integer> stack = new LinkedList<>(); // Push element x to the back of queue. public void push(int x) {

题目：https://leetcode.com/problems/binary-tree-paths/代码：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(i

题目：https://leetcode.com/problems/palindrome-linked-list/代码：/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; }

题目：https://leetcode.com/problems/longest-common-prefix/代码：public class Solution { public String longestCommonPrefix(String[] strs) { int length = strs.length; if(length==0)

题目：https://leetcode.com/problems/factorial-trailing-zeroes/代码：public class Solution {public int trailingZeroes(int n) { int count = 0; while(n > 0) { n /= 5; count += n; }

题目：https://leetcode.com/problems/binary-tree-level-order-traversal/代码：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right;

题目：https://leetcode.com/problems/palindrome-number/代码：public class Solution { public boolean isPalindrome(int x) { if(x<0) return false; List<Integer> temp = new ArrayLi

题目:https://leetcode.com/problems/pascals-triangle-ii/代码：public class Solution { public List<Integer> getRow(int rowIndex) { List<List<Integer>> temp = new ArrayList<>(); List<Intege

题目：https://leetcode.com/problems/path-sum/ 代码：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) {

题目：https://leetcode.com/problems/valid-sudoku/代码：public class Solution { public boolean isValidSudoku(char[][] board) { int col = board.length; int cow = board[0].length; Ar

题目：https://leetcode.com/problems/minimum-depth-of-binary-tree/代码：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; *

题目：https://leetcode.com/problems/implement-stack-using-queues/代码：class MyStack { // Push element x onto stack. Queue<Integer> q1 = new LinkedList<Integer>(); Queue<Integer> q2 = new LinkedL

题目：https://leetcode.com/problems/reverse-string/代码：public class Solution { public String reverseString(String s) { StringBuffer m = new StringBuffer(); for(int i=s.length()-1;i>=0;i

题目：https://leetcode.com/problems/nim-game/代码：public class Solution { public boolean canWinNim(int n) { if ( n%4 == 0 ) return false; else return true; }

题目:https://leetcode.com/problems/add-digits/代码：刚开始思考，感觉很麻烦，想到用循环来计算位数，计算和后来一想，最后的结构就在0到9之间，那么肯定是有一定的规律的，因此就有以下这种简单点方法public class Solution { public int addDigits(int num) { int m = (num-9

题目：https://leetcode.com/problems/maximum-depth-of-binary-tree/代码：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; *

题目：https://leetcode.com/problems/invert-binary-tree/代码：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(

题目：https://leetcode.com/problems/intersection-of-two-arrays/代码：ArrayLIst <>尖括号内不能放基本类型，比如char，int，要想放int就在尖括号内放Integer：ArrayList<integer>public class Solution { public int[] intersection(int[] nu

题目：https://leetcode.com/problems/move-zeroes/代码：ArrayList只能用.get得到数据public class Solution { public void moveZeroes(int[] nums) { ArrayList<Integer> m = new ArrayList<Integer>(); fo

题目：https://leetcode.com/problems/delete-node-in-a-linked-list/代码：/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val

题目：https://leetcode.com/problems/same-tree/代码：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) {

题目：https://leetcode.com/problems/valid-anagram/代码：char也能用Arrays.sort()排序public class Solution { public boolean isAnagram(String s, String t) { if(s.length()!=t.length()) return

题目：https://leetcode.com/problems/excel-sheet-column-number/代码：public class Solution { public int titleToNumber(String s) { char[] m = s.toCharArray(); int count = m.length-1;

题目：https://leetcode.com/problems/majority-element/代码：public class Solution { public int majorityElement(int[] nums) { Arrays.sort(nums); int limit = (int)(nums.length/2.0);

题目：https://leetcode.com/problems/contains-duplicate/代码：public class Solution { public boolean containsDuplicate(int[] nums) { Arrays.sort(nums); for(int i=0;i<nums.length-1;i++)

题目：https://leetcode.com/problems/intersection-of-two-arrays-ii/代码：public class Solution { public int[] intersect(int[] nums1, int[] nums2) { int[] flag = new int[nums2.length]; Arra

题目：https://leetcode.com/problems/reverse-linked-list/代码：/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } *

题目：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/代码：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * Tre

题目：https://leetcode.com/problems/number-of-1-bits/代码：java中有三种移位运算符<< : 左移运算符，num << 1,相当于num乘以2>> : 右移运算符，num >> 1,相当于num除以2>>> : 无符号右移，忽略符号位，空位都以0补齐public class Solution {

题目：https://leetcode.com/problems/power-of-two/代码：public class Solution { public boolean isPowerOfTwo(int n) { return n>0 && Math.pow(2,(int)(Math.log(Integer.MAX_VALUE)/Math.log(2.0)))%n==0

题目：https://leetcode.com/problems/power-of-three/代码：public class Solution { public boolean isPowerOfThree(int n) { int count=0; double flag; do{ flag = Math.pow(3,

题目：https://leetcode.com/problems/add-binary/代码：public class Solution { public String addBinary(String a, String b) { int lengtha = a.length(); int lengthb = b.length(); int i

题目：https://leetcode.com/problems/contains-duplicate-ii/代码：public class Solution { public boolean containsNearbyDuplicate(int[] nums, int k) { Set<Integer> res = new HashSet<>(); for

题目：https://leetcode.com/problems/intersection-of-two-linked-lists/代码：/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) {

题目：https://leetcode.com/problems/rectangle-area/代码：public class Solution { public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { int col,cow; col = Ma