OJ
关注
分享
扫一扫
飞奔的六六
这个作者很懒，什么都没留下…
展开
-
【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 · 511 阅读 · 0 评论 -
【leetcode】938. Range Sum of BST
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { ...原创 2019-05-02 12:07:27 · 195 阅读 · 0 评论 -
【leetcode】811. Subdomain Visit Count
class Solution { public List<String> subdomainVisits(String[] cpdomains) { List<String> result = new ArrayList(); Map<String,Integer> domainMap = new Hash...原创 2019-05-02 13:38:46 · 191 阅读 · 0 评论 -
【leetcode】985. Sum of Even Numbers After Queries
class Solution { public int[] sumEvenAfterQueries(int[] A, int[][] queries) { int[] result = new int[A.length]; for(int j=0; j<A.length; j++) { int[] query...原创 2019-05-02 13:52:35 · 262 阅读 · 0 评论 -
【leetcode】908. Smallest Range I
class Solution { public int smallestRangeI(int[] A, int K) { int min = A[0]; int max = A[0]; for(int a : A) { min = Math.min(min,a); ma...原创 2019-05-02 14:16:59 · 170 阅读 · 0 评论 -
【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 · 224 阅读 · 0 评论 -
【leetcode】897. Increasing Order Search Tree
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { Tre...原创 2019-05-02 15:05:15 · 213 阅读 · 0 评论 -
【leetcode】867. Transpose Matrix
class Solution { public int[][] transpose(int[][] A) { int row = A.length; int column = A[0].length; int[][] B = new int[column][row]; for(int i=0; i<r...原创 2019-05-02 15:27:40 · 186 阅读 · 0 评论 -
【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 · 321 阅读 · 0 评论 -
【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 · 215 阅读 · 0 评论 -
【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 · 314 阅读 · 0 评论 -
【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 · 161 阅读 · 0 评论 -
【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 · 219 阅读 · 0 评论 -
【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 · 146 阅读 · 0 评论 -
【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 · 159 阅读 · 0 评论 -
【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 · 148 阅读 · 0 评论 -
【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 · 264 阅读 · 0 评论 -
【POJ】POJ题目分类
转自：http://www.cnblogs.com/kuangbin/archive/2011/07/29/2120667.html初期:一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. (4)递推. (5)构造法.(poj3295)...转载 2019-03-13 16:47:31 · 552 阅读 · 0 评论 -
【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 · 207 阅读 · 0 评论 -
【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 · 155 阅读 · 0 评论 -
【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 · 279 阅读 · 0 评论 -
【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 · 176 阅读 · 0 评论 -
【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 · 320 阅读 · 0 评论 -
【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 · 194 阅读 · 0 评论 -
【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 · 137 阅读 · 0 评论 -
【leetcode】804. Unique Morse Code Words
class Solution { public int uniqueMorseRepresentations(String[] words) { String[] morse = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.",...原创 2019-04-18 00:04:48 · 177 阅读 · 0 评论 -
【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 · 189 阅读 · 0 评论 -
【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 · 147 阅读 · 0 评论 -
【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 · 3122 阅读 · 2 评论 -
【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 · 144 阅读 · 0 评论 -
【leetcode】557. Reverse Words in a String III
class Solution { public String reverseWords(String s) { String[] words = s.split(" "); StringBuffer sb = new StringBuffer(); for(String word : words) { ...原创 2019-05-07 16:24:51 · 215 阅读 · 0 评论