java - 随笔分类 - xiaoba1203

摘要：java中调用commons.math3使用最小二乘法。在这里记录一下使用方法。阅读全文

posted @ 2016-11-27 17:50 xiaoba1203 阅读(1869) 评论(0) 推荐(0)

Tips

摘要：1.StringBuffer 与 StringBuilder a.执行速度：StringBuilder > StringBuffer =>　单线程操作大量数据 : StringBuilder b.StringBuilder:线程非安全的 StringBuffer :线程安全 => 多线程操作大量数据阅读全文

posted @ 2016-11-23 15:23 xiaoba1203 阅读(155) 评论(0) 推荐(0)

leetcode 94 Binary Tree Inorder Traversal ----- java

摘要：Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree [1,null,2,3], return [1,3,2]. Note: Recursive so 阅读全文

posted @ 2016-10-20 19:02 xiaoba1203 阅读(208) 评论(0) 推荐(0)

leetcode 93 Restore IP Addresses ----- java

摘要：Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example:Given "25525511135", return ["2 阅读全文

posted @ 2016-10-20 18:23 xiaoba1203 阅读(307) 评论(0) 推荐(0)

leetcode 92 Reverse Linked List II ----- java

摘要：Reverse a linked list from position m to n. Do it in-place and in one-pass. For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2- 阅读全文

posted @ 2016-10-20 16:37 xiaoba1203 阅读(226) 评论(0) 推荐(0)

leetcode 91 Decode Ways ----- java

摘要：A message containing letters from A-Z is being encoded to numbers using the following mapping: Given an encoded message containing digits, determine t 阅读全文

posted @ 2016-10-20 15:19 xiaoba1203 阅读(310) 评论(0) 推荐(0)

leetcode 90 Subsets II ----- java

摘要：Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: The solution set must not contain duplicate sub 阅读全文

posted @ 2016-10-19 23:25 xiaoba1203 阅读(619) 评论(0) 推荐(0)

leetcode 89 Gray Code ----- java

摘要：The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total num 阅读全文

posted @ 2016-10-19 22:06 xiaoba1203 阅读(290) 评论(0) 推荐(0)

leetcode 88 Merge Sorted Array ----- java

摘要：Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size tha 阅读全文

posted @ 2016-10-19 22:04 xiaoba1203 阅读(140) 评论(0) 推荐(0)

leetcode 85 Maximal Rectangle ----- java

摘要：Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. For example, given the following 阅读全文

posted @ 2016-10-19 11:46 xiaoba1203 阅读(398) 评论(0) 推荐(0)

leetcode 86 Partition List ----- java

摘要：Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the 阅读全文

posted @ 2016-10-19 11:15 xiaoba1203 阅读(150) 评论(0) 推荐(0)

leetcode 84 Largest Rectangle in Histogram ----- java

摘要：Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文

posted @ 2016-10-18 23:17 xiaoba1203 阅读(139) 评论(0) 推荐(0)

leetcode 83 Remove Duplicates from Sorted List ----- java

摘要：Given a sorted linked list, delete all duplicates such that each element appear only once. For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, 阅读全文

posted @ 2016-10-18 19:06 xiaoba1203 阅读(128) 评论(0) 推荐(0)

leetcode 81 Search in Rotated Sorted Array II ----- java

摘要：Follow up for "Search in Rotated Sorted Array": Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this affect the 阅读全文

posted @ 2016-10-18 18:15 xiaoba1203 阅读(215) 评论(0) 推荐(0)

leetcode 80 Remove Duplicates from Sorted Array II ----- java

摘要：Follow up for "Remove Duplicates":What if duplicates are allowed at most twice? For example,Given sorted array nums = [1,1,1,2,2,3], Your function sho 阅读全文

posted @ 2016-10-16 18:02 xiaoba1203 阅读(226) 评论(0) 推荐(0)

leetcode 79 Word Search ----- java

摘要：Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjac 阅读全文

posted @ 2016-10-16 17:40 xiaoba1203 阅读(687) 评论(0) 推荐(0)

leetcode 78 Subsets ----- java

摘要：Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example,If nums = 阅读全文

posted @ 2016-10-16 16:32 xiaoba1203 阅读(225) 评论(0) 推荐(0)

leetcode 77 Combinations ----- java

摘要：Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is: 求C(k,n)的所有结果。阅读全文

posted @ 2016-10-16 16:20 xiaoba1203 阅读(280) 评论(0) 推荐(0)

leetcode 75 Sort Colors ----- java

摘要：Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, 阅读全文

posted @ 2016-10-15 23:30 xiaoba1203 阅读(159) 评论(0) 推荐(0)

leetcode 73 Set Matrix Zeroes ----- java

摘要：Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. click to show follow up. Follow up: Did you use extra sp 阅读全文

posted @ 2016-10-15 18:32 xiaoba1203 阅读(569) 评论(0) 推荐(0)

随笔分类 - java

公告