当以乐-CSDN博客

原创纪录一下我看过的那些书籍

古语云:温故而知新.可谓道出学习的真谛.虽然读了很多书,写了很多博客,也不敢说都已经会了,只能说当时会了.而作为学习闭环的最后一个过程.温故是十分重要,故而写此篇博文,纪录那些我读过的书籍,忘有空暇时间,将其中值得再次品读的部分,好好回顾.1.技术类书籍<<设计模式>>GOF设计模式是一本经典书籍,值得多次阅读,但是初始阅读是不必苛求自己能深入...

2017-03-22 18:10:57 1175 2

Webflux是Spring中一个非阻塞的框架,使用方式类似SpringMVC.最近用该框架做了个网关服务的重构.因为其中遇到了些问题.比较难解决的就是这个GET请求如果包含中文且发送时候没有用URL编码的话,直接就乱码了.无法进行后续的处理了.报错如下:org.springframework.http.server.reactive.ReactorHttpHandlerAdapter - Invalid URL for incoming request: Illegal cha...

2021-07-06 19:01:40 1183

原创 docker方式部署ELK

1.拉取原始镜像: docker pull sebp/elk:6602.启动下镜像方便进入,进行自定义配置修改:docker run -dit --name elk \-p 5601:5601 \-p 9200:9200 \-p 5044:5044 \-v /data/elasticsearch:/var/lib/elasticsearch \-v /etc/localtime:/etc/localtime \sebp/elk:660这里说明下5601是kibana的端口

2020-07-01 18:04:05 1239

原创 Bazel和Springboot中使用Jython的方法

最近重构一个Java写的计算器项目.项目中核心实现是用Jython来进行计算过程的.由于是老项目,直接使用的是Maven+Javaweb方式.依赖:<dependency> <groupId>org.python</groupId> <artifactId>jython-standalone</artifactId&g...

2018-12-04 13:10:04 2015

原创 Java高并发程序设计

第一章走入并行世界关于并行的两个定律: Amdahl定律和Gustafson定律考虑方向不同 Java内存模型 JMM 原子性可见性有序性第二章 Java并行程序基础线程创建: new Thread(Runable).start() 线程终止: stop 方法会立即释放锁,导致数据不一致问题,已经废弃线程中断...

2018-09-16 16:06:38 380

原创深入理解Java虚拟机--垃圾收集及故障诊断

1.垃圾收集算法 1.1 标记-清除算法算法分为标记和清除两个阶段:首先标记出所有需要回收的对象,在标记完成后统一回收所有被标记的对象,标记过程上一篇博客说过,后续的几种算法都是基于这个算法对其不足进行改进.不足的地方只要有两点:一个是效率问题,标记和清除两个过程的效率都不高,另外一个不足是空间问题,标记清除后会产生大量不连续的空间碎片,空间碎片太多可能会...

2018-09-09 19:09:18 276

原创关于docker运行Java程序JVM配置参数使用jconsole的简单量化过程

1.如果服务可以本地启动那么尽量在本地进行参数预估2.如果服务不能本地启动,可以使用远程连接方式进行预估 3.衡量要点:Java程序运行大致分为三块:堆内存,非堆内存(虚拟机栈,方法区,本地方法栈,程序计数器),堆外内存.docker容器中运行除了Java程序还需要为其余程序余力内存空间.这里假设统一预留50M空间.3.1 堆内存的量化堆内存主要分为几个区域,新生代,复...

2018-09-05 11:42:18 17022 1

原创深入理解Java虚拟机--初探

1.走近Java 这一章主要介绍了Java的发展历史,JVM种类,最后的编译OpenJDK.我编译的OpenJDK10.2.Java内存区域与内存溢出异常 2.1 JVM中几个数据区方法区,虚拟机栈,本地方法栈,堆,程序计数器. 2.2.1 程序计数器是一块较小的内存空间,它可以看作是当前线程所执行的字...

2018-09-01 23:09:34 302

原创 Gitlab 开发流程涉及命令梳理

简介: gitlab是一种流行的代码管理工具,主要的开发方式为分支开发合并.下面介绍下我走通流程涉及的命令点.1. 配置SSH 需要在自己目录下生成公钥和私钥.网上很多https://blog.csdn.net/xyzchenxiaolin/article/details/518523332. 拉取master分支git clone [email protected].创建本地分支g...

2018-04-28 18:50:14 684

原创 Docker的安装和常用功能

一.如何安装Dockerdocker(mac) 下载:https://www.docker.com/community-edition#/download其余直接参考:centos需要到7才可.https://yq.aliyun.com/articles/110806?spm=5176.8351553.0.0.3f301991AiXEXn配置镜像加速(阿里云)https://cr.console....

2018-04-28 18:27:35 300

原创 Spring Boot 要点小结

对于Web开发而言,Spring Boot 最近比较有名气.我觉得主要的原因在于开箱即用及功能广泛的特点. 明白Spring Boot 是什么?说到底,其实底层的实现都是一致的,Spring Boot 以Pom.xml依赖的方式免去了原来繁琐的配置整合,默认给你提供你引入功能的默认配置.你要做的仅仅是将原来你做的事情,转化为Spring Boot 提供的规则实现的方式而已.大大加快了基层开

2018-01-15 16:16:53 2329

原创 LeetCode-Easy刷题(33) Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get

2017-11-30 19:23:42 367

原创 LeetCode-Easy刷题(32) Linked List Cycle

Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?给定一个链表，确定它是否有一个循环。你能在不使用额外空间的情况下解决它吗? //两个速度指针 public boolean hasC

2017-11-30 19:22:51 308

原创 LeetCode-Easy刷题(31) Single Number

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

2017-11-30 19:22:15 277

原创 LeetCode-Easy刷题(30) Best Time to Buy and Sell Stock II

Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one

2017-11-30 19:21:28 274

原创 LeetCode-Easy刷题(29) Best Time to Buy and Sell Stock

Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), d

2017-11-30 19:20:37 280

原创 LeetCode-Easy刷题(28) Pascal's Triangle II

Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space?给定一个索引k，返回帕斯

2017-11-30 19:19:47 260

原创 LeetCode-Easy刷题(27) Pascal's Triangle

Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]给定numRows，生成帕斯卡三角形的第一个num

2017-11-30 19:19:05 254

原创 LeetCode-Easy刷题(26) Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum

2017-11-30 19:18:08 246

原创 LeetCode-Easy刷题(25) Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.找出二叉树的最小深度. //深度优先维护最小

2017-11-30 19:17:14 236

原创 LeetCode-Easy刷题(24) Balanced Binary Tree

Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never dif

2017-11-30 19:16:27 203

原创 LeetCode-Easy刷题(23) Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.将有序数组转化为二分查找树 public TreeNode sortedArrayToBST(int[] nums) { return toBSTHelp(nu

2017-11-29 18:49:07 232

原创 LeetCode-Easy刷题(22)Binary Tree Level Order Traversal II

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree [3,9,20,null,null,1

2017-11-29 18:48:24 248

原创 LeetCode-Easy刷题(21) Maximum Depth of Binary Tree

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.找出二叉树的最大深度. public int

2017-11-29 18:47:32 208

原创 LeetCode-Easy刷题(20) Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3B

2017-11-29 18:45:56 276

原创 LeetCode-Easy刷题(19) Same Tree

Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Exampl

2017-11-29 18:45:12 178

原创 LeetCode-Easy刷题(18) Merge Sorted Array

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 that is greater or equal to m + n) to hold add

2017-11-29 18:44:17 188

原创 LeetCode-Easy刷题(17) Remove Duplicates from Sorted List

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, return 1->2->3.删除排好序链表中重复的数字.返回一个数字不

2017-11-29 18:43:25 200

原创 LeetCode-Easy刷题(16) Climbing Stairs

You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a positive

2017-11-29 18:42:47 194

原创 LeetCode-Easy刷题(15) Sqrt(x)

Implement int sqrt(int x).Compute and return the square root of x.x is guaranteed to be a non-negative integer.Example 1:Input: 4Output: 2Example 2:Input: 8Output: 2Explanation: The

2017-11-29 18:41:48 147

原创 LeetCode-Easy刷题(14) Add Binary

Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".二进制字符串相加返回结果字符串 //维护一个进位指针 public static String addBinary(String a, St

2017-11-28 18:16:04 214

原创 LeetCode-Easy刷题(13) Plus One

Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain any leading zero, except the number 0 itself.The digits a

2017-11-28 18:14:59 184

原创 LeetCode-Easy刷题(12) Length of Last Word

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is def

2017-11-28 18:13:58 143

原创 LeetCode-Easy刷题(11) Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [4,-1,2,1] has

2017-11-28 18:13:05 238

原创 LeetCode-Easy刷题(10) Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.

2017-11-28 12:12:45 188

原创 LeetCode-Easy刷题(9) Implement strStr()

Implement strStr().Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Example 1:Input: haystack = "hello", needle = "ll"Output: 2Example

2017-11-28 12:11:26 182

原创 LeetCode-Easy刷题(8) Remove Element

Given an array and a value, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you must do this by modifying the input array in-pl

2017-11-28 12:09:46 171

原创 LeetCode-Easy刷题(7) Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this by modifying

2017-11-28 12:08:34 192

原创 LeetCode-Easy刷题(6) Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.合并两个排序链表，并将其作为一个新列表返回。新的列表应该通过将前两个列表的节点拼接在一起。

2017-11-27 20:14:43 141

原创 LeetCode-Easy刷题(5) Valid Parentheses

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all vali

2017-11-27 20:13:38 180

docker从入门到实战

Solr官方文档

空空如也