11namespace LeetCodeNet . G0101_0200 . S0133_clone_graph {
2+
23public class Node {
34public int val ;
45public IList < Node > neighbors ;
@@ -20,27 +21,31 @@ public Node(int _val, List<Node> _neighbors) {
2021
2122public override string ToString ( ) {
2223var result = new System . Text . StringBuilder ( ) ;
23- result . Append ( "[" ) ;
24+ result . Append ( '[' ) ;
2425bool first = true ;
2526foreach ( var node in neighbors ) {
26- if ( ! first ) result . Append ( "," ) ;
27+ if ( ! first ) {
28+ result . Append ( ',' ) ;
29+ }
2730if ( node . neighbors == null || node . neighbors . Count == 0 ) {
2831result . Append ( node . val ) ;
2932} else {
3033var inner = new System . Text . StringBuilder ( ) ;
31- inner . Append ( "[" ) ;
34+ inner . Append ( '[' ) ;
3235bool innerFirst = true ;
3336foreach ( var nodeItem in node . neighbors ) {
34- if ( ! innerFirst ) inner . Append ( "," ) ;
37+ if ( ! innerFirst ) {
38+ inner . Append ( ',' ) ;
39+ }
3540inner . Append ( nodeItem . val ) ;
3641innerFirst = false ;
3742}
38- inner . Append ( "]" ) ;
43+ inner . Append ( ']' ) ;
3944result . Append ( inner . ToString ( ) ) ;
4045}
4146first = false ;
4247}
43- result . Append ( "]" ) ;
48+ result . Append ( ']' ) ;
4449return result . ToString ( ) ;
4550}
4651}