java
不迷信_只迷人
这个作者很懒,什么都没留下…
展开
-
03.使用私有构造方法或者枚举类型实现单例Singleton属性【Effective Java】
Character 2 Creating and Destroying objects使用私有构造方法或者枚举类型执行单例singleton属性文章目录问题场景方法一:公共属性 public field方法二:静态工厂方法方法三:单一元素枚举类问题场景单例就是一个仅实例化一次的类(item95)。单例通常代表无状态对象,比如函数(item24)或者一个本质上唯一的系统组件。让一个类成为单例...原创 2020-04-06 12:14:03 · 248 阅读 · 0 评论 -
02.构造方法参数较多时考虑builder模式【Effective Java】
Character 2 Creating and Destroying objects构造方法参数较多时考虑builder模式问题场景静态工厂和构造器共有一个限制:在可选参数很多的情况下,这两个都不能够很好的scale。考虑一个代表在袋装食物上的营养标签的类,这些标签有一些必须要求的field,建议摄入量,每罐的量以及每份的卡路里,还有超过20个可选的field,总脂肪、饱和脂肪、反式脂肪...原创 2020-04-05 21:39:13 · 263 阅读 · 0 评论 -
01.使用静态工厂方法替代构造方法【Effective Java】
Character 2 Creating and Destroying objects使用静态工厂方法替代构造方法一个类允许客户端获取其实例的传统方式,是提供一个公共构造方法。 不过还有另一种技术应该成为每个程序员工具箱的一部分。 一个类可以提供一个简单的、只返回该类实例的公共静态工厂方法。 下面是一个 Boolean 简单的例子( 基本类型boolean的包装类)。 此方法将基本类型bool...原创 2020-04-05 19:54:03 · 301 阅读 · 0 评论 -
LeetCode Same Tree 100
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value./** * Definition原创 2016-04-23 19:56:23 · 292 阅读 · 0 评论 -
LeetCode Merge Sorted Array 88
88. Merge Sorted ArrayMy SubmissionsQuestionEditorial SolutionTotal Accepted: 96339 Total Submissions: 321421 Difficulty: EasyGiven two sorted integer arrays nums1 and nums2,原创 2016-04-12 22:52:19 · 601 阅读 · 0 评论 -
Leetcode Remove Duplicates from Sorted List 83
83. Remove Duplicates from Sorted ListMy SubmissionsQuestionEditorial SolutionTotal Accepted: 111563 Total Submissions: 304716 Difficulty: EasyGiven a sorted linked list, del原创 2016-04-12 22:19:38 · 283 阅读 · 0 评论 -
LeetCode Climbing Stairs 70
70. Climbing StairsMy SubmissionsQuestionEditorial SolutionTotal Accepted: 103589 Total Submissions: 283139 Difficulty: EasyYou are climbing a stair case. It takes n steps to原创 2016-04-11 23:05:57 · 314 阅读 · 0 评论 -
LeetCode Plus One 66
66. Plus OneMy SubmissionsQuestionEditorial SolutionTotal Accepted: 95281 Total Submissions: 285638 Difficulty: EasyGiven a non-negative number represented as an array of dig原创 2016-04-11 22:57:09 · 433 阅读 · 0 评论 -
leetcode Count and say
38. Count and SayMy SubmissionsQuestionEditorial SolutionTotal Accepted: 77548 Total Submissions: 269947 Difficulty: EasyThe count-and-say sequence is the sequence of integer原创 2016-04-09 23:41:55 · 392 阅读 · 0 评论 -
leetcode Valid Sudoku
36. Valid SudokuMy SubmissionsQuestionEditorial SolutionTotal Accepted: 70331 Total Submissions: 231579 Difficulty: EasyDetermine if a Sudoku is valid, according to: Sudoku P原创 2016-04-09 22:25:32 · 389 阅读 · 0 评论 -
leetcode Remove Element(27)
删除数组中指定元素 使用常数的空间public class Solution { public int removeElement(int[] nums, int val) { int len = nums.length; int posnum=0; for(int i = 0; i < len; i++){原创 2016-04-08 22:53:19 · 365 阅读 · 0 评论 -
leetcode Roman to Integer(13)
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999掌握罗马和数字之间的转化规则public class Solution { public int romanToInt(String s) {原创 2016-04-08 22:41:58 · 322 阅读 · 0 评论 -
Leetcode Symmetric Tree 101
判断二叉树是否对称Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric:1/ \ 2 2 / \ / \ 3 4 4 3 But the following原创 2016-04-23 21:40:01 · 396 阅读 · 0 评论 -
Leetcode Reverse Vowels of a String 345
Write a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”.交换元音字母 public cl原创 2016-04-23 22:14:04 · 411 阅读 · 0 评论 -
java 读取 Excel文件
操作步骤: 1.首先到网上载一下JExcelApi rar包,目前最新是:jexcelapi_2_6_12.tar,然后将其解压开,将 jxl.jar文件Copy到WEB-INF\lib目录下或直接导入到Java项目中 2.相应的操作代码如下: `package com.xqh.java.test; import java.io.File; import java.io.IOExcepti转载 2016-05-06 23:49:26 · 352 阅读 · 0 评论 -
设计模式学习博客总结--刘伟老师
http://blog.csdn.net/lovelion原创 2016-04-24 21:37:31 · 2067 阅读 · 0 评论 -
Leetcode Number of 1 Bits 191
Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11’ has binary representation 0000000000000原创 2016-04-29 20:18:46 · 263 阅读 · 0 评论 -
Leetcode Single Number 136
Given an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra me原创 2016-04-29 19:57:32 · 260 阅读 · 0 评论 -
Leetcode Missing Number 268
Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.For example, Given nums = [0, 1, 3] return 2.考虑线性时间同时空间尽可能小遍历一遍 求和 public class Solut原创 2016-04-29 19:28:05 · 262 阅读 · 0 评论 -
Leetcode Move Zeroes 283
Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your funct原创 2016-04-25 23:07:10 · 313 阅读 · 0 评论 -
Leetcode Maximum Depth of Binary Tree 104
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.继续水一发 DFS 递归解决 /** * Definition for a b原创 2016-04-25 22:50:45 · 282 阅读 · 0 评论 -
Leetcode Add Digits 258
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, r原创 2016-04-24 21:34:45 · 270 阅读 · 0 评论 -
Leetcode Power of Two 231
Given an integer, write a function to determine if it is a power of two.利用n&(n-1) public class Solution { public boolean isPowerOfTwo(int n) { if(n<=0) return false; if((n&(n-1))原创 2016-04-24 21:05:11 · 431 阅读 · 0 评论 -
Leetcode Power of Four 342
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example: Given num = 16, return true. Given num = 5, return false.Follow up: Could you solve it without loops/re原创 2016-04-24 21:01:36 · 290 阅读 · 0 评论 -
Leetcode Reverse String 344
Write a function that takes a string as input and returns the string reversed.Example: Given s = “hello”, return “olleh”.水一发public class Solution { public String reverseString(String s) {原创 2016-04-24 20:39:58 · 316 阅读 · 0 评论 -
javaweb1000例 (一)
1.scanner 实现读数据2.BigDecimal 解决精度问题3.实现交互两个数 异或可以完成 (高效率 节省空间) a = a ^ b; b = b ^ a; a = a ^ b;原创 2015-08-07 22:52:52 · 726 阅读 · 0 评论