Component part of react foundation -- design composite component
Design composite components
Preface
Why do you ask me to blog? Because Alaska loves to write bugs!!!
WeChat public number: love to write bugger's Alaska
If there are any questions or suggestions, please go to the public address to share with us how to write bugger!
Book continued above -- component part II of rea ...
Posted by steelerman99 on Fri, 31 Jan 2020 01:08:18 -0800
Stack migration / stack hijacking
Example
https://github.com/scwuaptx/HITCON-Training/tree/master/LAB/lab6
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
int count = 1337 ;
int main(){
if(count != 1337)
exit(1);
count++;
char buf[40];
setvbuf(stdout,0,2,0);
puts("Try your ...
Posted by shelluk on Wed, 29 Jan 2020 22:21:29 -0800
[blockchain] Tendermint - local single node deployment
Tendermint
Due to work reasons, I began to contact Hyperledger Fabric two years ago, and its community is still very active. It has developed from v0.7 in that year to v2.0 now. But I have to say that Fabric's consideration is still very big, which is difficult for secondary development. So recently, ...
Posted by dayang on Wed, 29 Jan 2020 03:26:18 -0800
Java reuse class, polymorphic
Reuse class
There are two ways to reuse code:
Combination: only the objects of the existing class need to be generated in the new class. The new class is composed of the objects of the existing class, that is, the object reference can be placed in the new class
Inheritance: create a new class acc ...
Posted by Transwarp-Tim on Wed, 29 Jan 2020 02:43:19 -0800
Swordfinger offer Title Resolution (with video resolution link)
Write before
Code description: Code download address: https://github.com/WuNianLuoMeng/CodingVideo Description: The first time you record a video in this form, if there is anything wrong, please also point out in time, thank you~~
Finding in a two-dimensional array
Method 1:
By traversing the arra ...
Posted by marcela1637 on Tue, 28 Jan 2020 20:34:48 -0800
Java implements the BitSet manually
1. First of all, we need:
A suitable size of BitSet to save data
Several different hash functions customize different hash functions through random seed seed
The method of adding element to digit group (Bloom filter) implements add method
A method implementation that determines ...
Posted by SP8600 on Mon, 27 Jan 2020 06:34:33 -0800
Daily AC Series: Sum of Four
1 Topic
Leetcode Question 18 Given an array and a target, find out that the sum of the four numbers in the array is all four unreplicated numbers of the target.
2 Violence
List<List<Integer>> result = new ArrayList<>();
if (nums.length == 4 && nums[0] + nums[1] + nums[2] + nums[3] == target)
result.add(Arrays.asLi ...
Posted by pixelfish on Sat, 25 Jan 2020 21:57:39 -0800
Daily AC series: the closest sum of three
1 topic
The sixteenth question of leetcode , given an array and a target number, find out three numbers in the array. The sum of these three numbers should be closest to the target number.
2 violence
As a rule, the first O(n3) violence:
int temp = nums[0]+nums[1]+nums[2];
for(int i=0;i<nums.lengt ...
Posted by belaraka on Fri, 24 Jan 2020 01:24:12 -0800
[Xuefeng magnetite blog] Introduction to data science 3 - Introduction to statistics
# -*- coding: utf-8 -*-
from collections import Counter
from linear_algebra import sum_of_squares, dot
import math
import matplotlib.pyplot as plt
from pylab import mpl
mpl.rcParams['font.sans-serif'] = ['SimHei']
num_friends = [100,49,41,40,25,21,21,19,19,18,18,16,15,15,15,15,14,14,13,13,13,13,12,12,11,10,10,10,10,10,10,10,10,10 ...
Posted by monarlte on Thu, 23 Jan 2020 07:25:19 -0800
Java docking WeChat public number template message push
There are a lot of content, please be patient!
Recently, the company had this business demand, and I happened to complete it:
First, you want to connect, first you need a public number, and then you develop the document. https://developers.weixin.qq.com/doc/offiaccount/Getting_Started/Overview.html
But please pay attention to this
ok, let's c ...
Posted by Yola on Thu, 23 Jan 2020 03:00:42 -0800