System development software company also money

{"_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}]}

 

Also money system development, Chen Ling {I8O-28 micro electric 5O-I2} 2O , further software development money, money further model development, development of money further APP

Crowdfunding how to get started:

Debt help you record your first activation Recommended 200 yuan, the ninth stage of the public who raise $ 200.

You want to recommend three debtors to crowdfunding (must be a real liability) for your crowdfunding 200 yuan = 600 yuan per person to complete the first phase of the repayment

1 liter will stage a direct push to your superior play money 200 yuan to give nine pinch-hit section 200.

2. The second phase would like your rose 2 pinch section 200. You You can receive Layer 2 9 = 200 yuan 1800 yuan

3. The third phase would like to lift your upper section 200 yuan 3 Doug. You can receive your next layer 3 27 200 yuan = 5400 yuan

4. The fourth stage liter want to pinch your 4 paragraph 200. You can receive your 4 layers 81 200 yuan = 16,200 yuan

5. The fifth stage liter want to pinch your 5 section 200. You can receive your next 5 layers 243 200 yuan = 48,600 yuan

6. l sixth stage you want to pinch-hit section of the 6 200. You can receive your lower six layers 729 200 yuan = 145,800 yuan

7. liter seventh stage you want to pinch-hit on 7 section 200. You can receive your next layer 7 2187 200 yuan = 437,400 yuan

8. liters eighth stage you want to pinch-hit on 8, paragraph 200. You can receive your next layer 8 6561 200 yuan = 1,312,200 yuan

9. liter ninth stage you want to pinch-hit on 9 section 400, the team's need for a 81 second period. You can receive the following nine stages 19683 200 yuan = 3,936,600 yuan

Proceeds as follows

You recommend three each give you 200 yuan = 600 yuan you upgrade to the next stages, each stage upgrade 200 yuan

3 × 200 = 600 200 yuan per liter

9 × 200 = 1800 200 yuan per liter

27 × 200 = 5400 200 yuan per liter

//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; //颜色属性
The TreeNode (int the hash, Key K, V Val, the Node <K, V> Next) {
Super (the hash, Key, Val, Next);
}
// returns the current root node of the
final TreeNode <k, v> root () {
for (the TreeNode <K, V> = R & lt the this, P ;;) {
IF ((P = r.parent) == null)
return R & lt;
R & lt P =;
}
}
}

 

Guess you like

Origin www.cnblogs.com/wwwwwww5/p/11237102.html