{"_id":"top250","startUrl":["https://movie.douban.com/top250?start=[0-250:25]&filter="],"selectors":
[{"id":"container","type":"SelectorElement","parentSelectors":["_root"],"selector":".grid_view li","multiple":true,"delay":0},
{"id":"name","type":"SelectorText","parentSelectors":["container"],"selector":"span.title:nth-of-type(1)","multiple":false,"regex":"","delay":0},
{"id":"number","type":"SelectorText","parentSelectors":["container"],"selector":"em","multiple":false,"regex":"","delay":0},
{"id":"score","type":"SelectorText","parentSelectors":["container"],"selector":"span.rating_num","multiple":false,"regex":"","delay":0},
{"id":"review","type":"SelectorText","parentSelectors":["container"],"selector":"span.inq","multiple":false,"regex":"","delay":0}]}
有钱还系统开发，陈翎{I8O-28微5O-I2电2O}，有钱还软件开发，有钱还模式开发，有钱还APP开发
众筹如何开始：
您录入债务激活首先帮助您的推荐人200元、第九阶段众筹者200元。
您要推荐三名负债者来众筹（必须是有真实负债）每人为您众筹200元＝600元完成第一阶段还款
1.升一阶段就要向你的直推上级打款200元再给九代打款200。
2.升第二阶段要向你的上2代打款200元。您可收到您下2层9个200元＝1800元
3.升第三阶段要向你的上3代打款200元。您可收到您下3层27个200元＝5400元
4.升第四阶段要向你的上4代打款200元。您可收到您下4层81个200元＝16200元
5.升第五阶段要向你的上5代打款200元。您可收到您下5层243个200元＝48600元
6.升第六阶段要向你的上6代打款200元。您可收到您下6层729个200元＝145800元
7.升第七阶段要向你的上7代打款200元。您可收到您下7层2187个200元＝437400元
8.升第八阶段要向你的上8代打款200元。您可收到您下8层6561个200元＝1312200元
9.升第九阶段要向你的上9代打款400元，团队旗下需要81一个第二阶段。你就可以收到九阶段以下19683个200元＝3936600元
收益如下
您推荐三位每人给你200元＝600元您升级下一阶段，每阶段升级200元
3×200＝600元升200元
9×200＝1800元升200元
27×200＝5400元升200元
//hash桶中的结点Node,实现了Map.Entry
static class Node<K,V> implements Map.Entry<K,V> {
final int hash;
final K key;
V value;
Node<K,V> next; //链表的next指针
Node(int hash, K key, V value, Node<K,V> next) {
this.hash = hash;
this.key = key;
this.value = value;
this.next = next;
}
public final K getKey() { return key; }
public final V getValue() { return value; }
public final String toString() { return key + "=" + value; }
//重写Object的hashCode
public final int hashCode() {
return Objects.hashCode(key) ^ Objects.hashCode(value);
}
public final V setValue(V newValue) {
V oldValue = value;
value = newValue;
return oldValue;
}
//equals方法
public final boolean equals(Object o) {
if (o == this)
return true;
if (o instanceof Map.Entry) {
Map.Entry<?,?> e = (Map.Entry<?,?>)o;
if (Objects.equals(key, e.getKey()) &&
Objects.equals(value, e.getValue()))
return true;
}
return false;
}
}
//转变为红黑树后的结点类
static final class TreeNode<k,v> extends LinkedHashMap.Entry<k,v> {
TreeNode<k,v> parent; // 父节点
TreeNode<k,v> left; //左子树
TreeNode<k,v> right;//右子树
TreeNode<k,v> prev; // needed to unlink next upon deletion
boolean red; //颜色属性
TreeNode(int hash, K key, V val, Node<k,v> next) {
super(hash, key, val, next);
}
//返回当前节点的根节点
final TreeNode<k,v> root() {
for (TreeNode<k,v> r = this, p;;) {
if ((p = r.parent) == null)
return r;
r = p;
}
}
}