lsls path to view a list of directories under a certain path, ls / to view a zookeeper directory under the root directory. A directory is a node. / The root node zookeeper is a child node[zk: localhost:2181(CONNECTED) 1] ls / [zookeeper]statView node status information.[zk: localhost:2181(CONNECTED) 9] stat / cZxid = 0x0 ctime = Thu Jan 01 08:00:00 CST 1970 mZxid = 0x0 mtime = Thu Jan 01 08:00:00 CST 1970 pZxid = 0x0 cversion = -1 dataVersion = 0 aclVersion = 0 ephemeralOwner = 0x0 dataLength =

zookeeper role1.master节点选举, After the master node hangs up, the slave node will take over the work and ensure that this node is unique. This is also the so-called head mode, so as to ensure that our cluster is highly available. 2.统一配置文件管理, That is, only one server needs to be deployed, and the same network distribution files can be synchronized to all other servers. This operation is particularly used in cloud computing. 3.发布与订阅Similar to the MQ (amq, rmq...) of the message queue, the dubbo publ

1 Algorithm stepsFirst find the smallest (large) element in the unsorted sequence and store it at the beginning of the sorted sequenceThen continue to find the smallest (large) element from the remaining unsorted elements, and then put it at the end of the sorted sequence.Repeat the second step until all elements are sorted.selectionSort.gifPython code implementationdef selectionSort(arr): for i in range(len(arr)-1): # Record the minimum index minIndex = i for j in range(i + 1, len(arr)): if arr

Search algorithmadjacent_find()Within the range of the iterator pair identification elements, search for a pair of adjacent repeated elements, and return an iterator pointing to the first element of the pair of elements if found. Otherwise, it returns past-the-end. vector<int> vecInt; vecInt.push_back(1); vecInt.push_back(2); vecInt.push_back(3); vecInt.push_back(4); vecInt.push_back(5); vecInt.push_back(5); vector<int>::iterator it = adjacent_find(vecInt.begin(), vecInt.end());binar