!! This hanjie is a contactless hanjie (CLH). It is only logical with the constraint that no horizontal segment meet any vertical segment (except possibly with the corners) !!

We continue with another technic : smile-logic.
First, we check two conditions in two successive rows:
- the total number of cells we still have to blacken is equal to the number of columns we still have to complete
- at least one row doesn't contain any 1 (or not any more)
Then, we can deduce that the segments of these rows "alternate".
Of course, it works if we interchange "row" with "column".

Remark: That is an extension of the smile-pattern.

Examples:
At some point, we'll have 14 columns marked with a cross in both rows R5-6. So 11 columns left to be completed. But there are 7+2+2=11 cells to blaken (according to hanjie's indications). Thus, the first condition is verified.
Since row R5 doesn't contain any 1, the second condition is also verified.
Then, we can deduce that segments of R5-6 alternate.
By the way, since there is one more segments in R6, we can start the alternation by this row. Thus, we place the 2, then the 7, then the second 2, as follows (o are the black squares):
__ooooooo__
oo_______oo

Difficulty : ****

Tested, logical (as a CLH).
Smile-logic and some basics CLH-technicals can be usefull.
Good blackenage.