2019年04月_飞奔的六六

12月 09月 06月 05月 04月 03月 02月 01月

原创【leetcode】559. Maximum Depth of N-ary Tree

/*// Definition for a Node.class Node { public int val; public List<Node> children; public Node() {} public Node(int _val,List<Node> _children) { val = _val...

2019-04-24 11:52:47 273

原创【leetcode】883. Projection Area of 3D Shapes

class Solution { public int projectionArea(int[][] grid) { int count = 0; for (int i=0,v=0; i<grid.length; i++, count+=v, v=0) { for (int j=0; j<grid[i].len...

2019-04-24 11:02:59 192

原创【leetcode】1002. Find Common Characters

class Solution { public List<String> commonChars(String[] A) { List<String> dups = new ArrayList(); int length = A[0].length(); for(int i=0; i<length; i+...

2019-04-24 10:30:36 297

原创【leetcode】509. Fibonacci Number

斐波那契数列(限制30位)递归解法class Solution { public int fib(int N) { if(N==0) return 0; if(N==1) return 1; return fib(N-1)+fib(N-2); }}自底向上DP...

2019-04-23 14:38:07 199

原创【leetcode】999. Available Captures for Rook

class Solution { public int numRookCaptures(char[][] board) { int row = 0; int column = 0; boolean hasFound = false; for (int i=0; i<8; i++) { ...

2019-04-23 10:41:26 488

原创【leetcode】589. N-ary Tree Preorder Traversal

递归版本/*// Definition for a Node.class Node { public int val; public List<Node> children; public Node() {} public Node(int _val,List<Node> _children) { val = _...

2019-04-23 09:32:52 139

原创【leetcode】922. Sort Array By Parity II

class Solution { public int[] sortArrayByParityII(int[] A) { int temp; for(int i=0,j=1; i<A.length; i+=2) { if(A[i]%2!=0) { while(A[j]%2!=0) { ...

2019-04-23 01:17:11 128

原创【leetcode】590. N-ary Tree Postorder Traversal

/*// Definition for a Node.class Node { public int val; public List<Node> children; public Node() {} public Node(int _val,List<Node> _children) { val = _val...

2019-04-23 01:05:27 243

原创【leetcode】965. Univalued Binary Tree

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

2019-04-22 22:45:16 117

原创【Java】利用数组建立二叉树 & 建立二叉搜索树 & 层序遍历的简单实现

import java.util.LinkedList;import java.util.Queue;public class Tree { public static class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x...

2019-04-22 22:39:28 3079 2

原创【leetcode】700. Search in a Binary Search Tree

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

2019-04-22 19:20:50 122

原创【leetcode】1030. Matrix Cells in Distance Order

BFSclass Solution { public int[][] allCellsDistOrder(int R, int C, int r0, int c0) { int[][] Matrix = new int[R*C][2]; Queue<int[]> queue = new LinkedList(); bo...

2019-04-22 10:39:53 292

原创【leetcode】944. Delete Columns to Make Sorted

class Solution { public int minDeletionSize(String[] A) { String str = A[0]; int countD = 0; int length = str.length(); for (int i=0; i<length; i++) { ...

2019-04-21 22:25:11 155

原创【leetcode】852. Peak Index in a Mountain Array

class Solution { public int peakIndexInMountainArray(int[] A) { int prior = A[0]; for (int i=1; i<A.length; i++) { if (A[i]<prior) { return i-...

2019-04-21 17:40:46 252

原创【leetcode】942. DI String Match

class Solution { public int[] diStringMatch(String S) { char[] chs = S.toCharArray(); int[] A = new int[chs.length+1]; int low = 0; int high = chs.length; ...

2019-04-21 17:27:00 129

原创【leetcode】832. Flipping an Image

class Solution { public int[][] flipAndInvertImage(int[][] A) { int temp; for (int[] a : A) { for (int i=0,j=a.length-1; ; i++,j--) { ...

2019-04-20 17:14:56 185

原创【leetcode】905. Sort Array By Parity

思路分配两个与A同长的数组，分别保持偶数和奇数；有个指针标记共有多少个偶数，根据标记将奇数数组全部拼接在偶数之后。class Solution { public int[] sortArrayByParity(int[] A) { int[] even = new int[A.length]; int[] odd = new int[A.le...

2019-04-19 21:08:29 125

原创【leetcode】961. N-Repeated Element in Size 2N Array

class Solution { public int repeatedNTimes(int[] A) { int[] count = new int[10000]; for (int i : A) { if (count[i]++ == 1) { return i; }...

2019-04-19 21:02:31 199

原创【leetcode】977. Squares of a Sorted Array

思路从数组左右两边同时开始，因为数组初始有序，所以可以直接比较绝对值大小，大的放在结果数组最后，依次排到最前。class Solution { public int[] sortedSquares(int[] A) { int[] result = new int[A.length]; for (int i=0,j=A.le...

2019-04-19 21:01:23 139

原创【leetcode】929. Unique Email Addresses

class Solution { public int numUniqueEmails(String[] emails) { List finalEmails = new ArrayList(); for(String email : emails) { char[] chs = email.toCharArray...

2019-04-18 00:28:40 164

原创【leetcode】804. Unique Morse Code Words

class Solution { public int uniqueMorseRepresentations(String[] words) { String[] morse = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.",...

2019-04-18 00:04:48 158

原创【leetcode】709. To Lower Case

class Solution { public static String toLowerCase(String str) { char[] chs = str.toCharArray(); for(int i=0; i<chs.length; i++) { if(Character.isUpperCase(chs[i])) ...

2019-04-17 17:47:06 114

原创【leetcode】1021. Remove Outermost Parentheses

思路用一个count变量对"("计数，每入一个新的"("count加1，每入一个新的")"count减1。因为去除的是最外层括号，所以在count为0时不保存左括号，count为1时不保存右括号。class Solution { public String removeOuterParentheses(String S) { char[] chs = S...

2019-04-17 17:28:30 163