Bryan要加油

原创 Leetcode需要重复看的题目

目录没思路动态规划有优化解法没思路动态规划Best Time to Buy and Sell Stock有优化解法

转载 在博客文章中插入数学公式

http://www.ruanyifeng.com/webapp/formula.html

原创 asp.net core 生成RSA密钥对

asp.net core生成rsa密钥对

原创 Node Sass does not yet support your current environment: Windows 64-bit with Unsupported runtime

npm uninstall node-sassnpm install node-sass

原创 Kafka Ubuntu 20.04开机启动

添加systemd servicecd /etc/systemd/systemtouch kafka.service[Unit]# Kafka服务的描述Description=Kafka Service# 服务依赖—在什么服务之后启动，一般为在网络服务启动后启动After=network.target zookeeper.service [Service]Type=forking# 启动环境参数# 此脚本指定了Zookeeper日志和Java的目录#Environment=

原创 .net core zookeeper入门

https://www.cnblogs.com/shanfeng1000/p/12675498.html

原创 zookeeper ubuntu 20.04 开机启动

添加systemd servicecd /etc/systemd/systemtouch zookeeper.servicezookeeper.service的内容如下[Unit]# Zookeeper服务的描述Description=Zookeeper Service# 服务依赖—在什么服务之后启动，一般为在网络服务启动后启动After=network.target [Service]# 服务类型—如果是shell脚本的方式,则Type=forking,否则不指定作何值(也就是去掉

原创 Azure虚拟机挂载数据磁盘

找到磁盘lsblk对新磁盘进行分区sudo parted /dev/sda --script mklabel gpt mkpart xfspart xfs 0% 100%sudo mkfs.xfs /dev/sdasudo partprobe /dev/sda挂载磁盘sudo mkdir /home/bryan/datasudo mount /dev/sda /home/bryan/data添加开机自动挂载sudo blkidsudo vim /etc/fstab.

原创 Cache Strategies 缓存策略

Cache AsideCache-aside caches are usually general purpose and work best for read-heavy workloads. Memcached and Redis are widely used.Read ProcessThe application first checks the cache.If the data is found in cache, we’ve cache hit. The data is rea

原创 UML conventions

原创 Performance Metrics for System Design

ScalabilityReliabilityAvailabilityEfficiencyLatencyThroughputManageability

原创 853. Car Fleet[单调栈]

ProblemThere are n cars going to the same destination along a one-lane road. The destination is target miles away.You are given two integer array position and speed, both of length n, where position[i] is the position of the ith car and speed[i] is the s

原创 Test gRPC services with gRPCurl in ASP.NET Core

https://docs.microsoft.com/en-us/aspnet/core/grpc/test-tools?view=aspnetcore-5.0

原创 [重构]第一章：重构，第一个案例

import java.util.Enumeration;import java.util.Vector;public class Movie { public static final int CHILDRENS = 2; public static final int REGULAR = 0; public static final int NEW_RELEASE = 1; private String _title; private int _price

原创 OBSERVER

定义Observer is a behavioral design pattern that lets you define a subscription mechanism to notify multiple objects about any events that happen to the object they’re observing.类图示例代码using System;using System.Collections.Generic;using System.Threadin

原创 STRATEGY

定义Strategy is a behavioral design pattern that lets you define a family of algorithms, put each of them into a separate class,and make their objects interchangeable.类图示例代码using System;using System.Collections.Generic;namespace RefactoringGuru.Desig

原创 asp.net core cache

In-memory & Distributed (Redis) Caching in ASP.NET Core

原创 test_api

import asynciofrom asyncio import sleepimport aiohttpasync def get_metadata(session): url = 'http://localhost:30016/api/v1/projects/dc5047af-20e2-384c-9510-aa3882399111/files?path=%2FCAP_DEV%2FProjects%2Fdc5047af-20e2-384c-9510-aa3882399111%2FDatase

原创 SOLID Design Principles in C#

Single Responsibility PrincipleOpen-Closed PrincipleLiskov Substitution PrincipleInterface SegregationDependency Inversion Principle

原创 剑指 Offer 22. 链表中倒数第k个节点[Easy](Leetcode每日一题-2021.09.02)

Problem输入一个链表，输出该链表中倒数第k个节点。为了符合大多数人的习惯，本题从1开始计数，即链表的尾节点是倒数第1个节点。例如，一个链表有 6 个节点，从头节点开始，它们的值依次是 1、2、3、4、5、6。这个链表的倒数第 3 个节点是值为 4 的节点。Example给定一个链表: 1->2->3->4->5, 和 k = 2.返回链表 4->5.Solution/** * Definition for singly-linked list. *

原创 165. Compare Version Numbers[Medium](Leetcode每日一题-2021.09.01)

ProblemGiven two version numbers, version1 and version2, compare them.Version numbers consist of one or more revisions joined by a dot ‘.’. Each revision consists of digits and may contain leading zeros. Every revision contains at least one character. Re

原创 1109. Corporate Flight Bookings[Medium](Leetcode每日一题-2021.08.31)

Problem

原创 528. Random Pick with Weight[Medium](Leetcode每日一题-2021.08.30)

Problem

原创 1588. Sum of All Odd Length Subarrays[Easy](Leetcode每日一题-2021.08.29)

Problem

原创 1480. Running Sum of 1d Array[Easy](Leetcode每日一题-2021.08.28)

Problem

原创 295. Find Median from Data Stream[Hard](Leetcode每日一题-2021.08.27)

Problem

原创 881. Boats to Save People[Medium](Leetcode每日一题-2021.08.26)

Problem

原创 797. All Paths From Source to Target[Medium](Leetcode每日一题-2021.08.25)

Problem

原创 787. Cheapest Flights Within K Stops[Medium](Leetcode每日一题-2021.08.24)

ProblemThere are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to city toi with cost pricei.You are also given three integers src, dst

原创 1646. Get Maximum in Generated Array[Easy](Leetcode每日一题-2021.08.23)

Problem

原创 789. Escape The Ghosts[Medium](Leetcode每日一题-2021.08.22)

Problem曼哈顿距离

原创 443. String Compression[Medium](Leetcode每日一题-2021.08.21)

Problem

原创 541. Reverse String II[Easy](Leetcode每日一题-2021.08.20)

Problem

原创 345. Reverse Vowels of a String[Easy](Leetcode每日一题-2021.08.19)

Problem

原创 552. Student Attendance Record II[Hard](Leetcode每日一题-2021.08.18)

Problem

原创 551. Student Attendance Record I[Easy](Leetcode每日一题-2021.08.17)

ProblemYou are given a string s representing an attendance record for a student where each character signifies whether the student was absent, late, or present on that day. The record only contains the following three characters:‘A’: Absent.‘L’: Late.

原创 526. Beautiful Arrangement[Medium](Leetcode每日一题-2021.08.16)

位运算DP

原创 576. Out of Boundary Paths[Medium](Leetcode每日一题-2021.08.15)

DP

原创 1583. Count Unhappy Friends[Medium](Leetcode每日一题-2021.08.14)

模拟

原创 233. Number of Digit One[Hard](Leetcode每日一题-2021.08.13)

数位DP