Skip to content

Commit 1deede3

Browse files
yanglbmeactions-user
authored andcommitted
style: prettify code
1 parent 35c3d44 commit 1deede3

File tree

2 files changed

+1
-2
lines changed
  • lcof

2 files changed

+1
-2
lines changed

lcof/面试题25. 合并两个排序的链表/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -161,7 +161,7 @@ public:
161161
if (nullptr == l1 || nullptr == l2) {
162162
return l1 == nullptr ? l2 : l1; // 有且仅有一个为空,则返回非空节点
163163
}
164-
164+
165165
ListNode* node = nullptr;
166166
if (l1->val > l2->val) {
167167
node = l2;

lcof/面试题26. 树的子结构/README.md

-1
Original file line numberDiff line numberDiff line change
@@ -162,7 +162,6 @@ func helper(a *TreeNode, b *TreeNode) bool {
162162
}
163163
```
164164

165-
166165
### **C++**
167166

168167
```cpp

0 commit comments

Comments
 (0)