原创 520. Detect Capital+substring字符串截取

Given a word, you need to judge whether the usage of capitals in it is right or not. We define the usage of capitals

原创 zookeeper簡介與梳理

zookeeper就是分佈式的註冊中心 配置文件 tickTime=2000 initLimit=10 syncLimit=5 dataDir=/app/soft/zookeeper-3.4.6/data (換成真實輸出目錄) clie

原创 412. Fizz Buzz+String與int類型轉化

Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should

原创 496. Next Greater Element I+附hashmap用法

You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all t

原创 627. Swap Salary+編程中早晚用到的|、||、&、&&、異或、~、!運算

Given a table salary, such as the one below, that has m=male and f=female values. Swap all f and m values (i.e., cha

原创 606. Construct String from Binary Tree

You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing w

原创 dubbo簡介與梳理

1.架構圖 節點 角色說明 Provider 暴露服務的服務提供方 Consumer 調用遠程服務的服務消費方 Registry 服務註冊與發現的註冊中心 Monitor 統計服務的調用次數和調用時間的監控中心 Container 服務

原创 599. Minimum Index Sum of Two Lists

Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list of favorite restaurants repr

原创 463. Island Perimeter

You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid c

原创 538. Convert BST to Greater Tree

Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to

原创 485. Max Consecutive Ones

Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Input: [1,1,0,1,1,1] Outpu

原创 389. Find the Difference注意異或運算的巧妙使用^

Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string 

原创 136. Single Number

Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm s

原创 448. Find All Numbers Disappeared in an Array

Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

原创 Netty介紹梳理

    netty梳理 1.io和nio區別  多了個篩選器進行篩選 2.jdk的nio的wpoll空輪詢導致cpu飆升100% 3.netty的線程模型 Netty 線程模型 3.1Acceptor中的NioEventLoop用於