algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 08:50:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

链表相交文档结构格式化

Browse Source
This commit is contained in:
skyclouds2001
2023-04-30 14:24:26 +08:00
committed by GitHub
parent 66ad8c156d
commit 513707ca71
1 changed files with 6 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
problems/面试题02.07.链表相交.md
View File

@ -101,8 +101,8 @@ public:
## 其他语言版本 ## 其他语言版本
Java：
### Java
```Java ```Java
public class Solution { public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) { public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
@ -150,9 +150,9 @@ public class Solution {
} }
``` ```
### Python Python：
```python
```python
class Solution: class Solution:
def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode: def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
lenA, lenB = 0, 0 lenA, lenB = 0, 0
@ -179,7 +179,7 @@ class Solution:
return None return None
``` ```
### Go Go：
```go ```go
func getIntersectionNode(headA, headB *ListNode) *ListNode { func getIntersectionNode(headA, headB *ListNode) *ListNode {
@ -240,7 +240,7 @@ func getIntersectionNode(headA, headB *ListNode) *ListNode {
} }
``` ```
### javaScript JavaScript：
```js ```js
var getListLen = function(head) { var getListLen = function(head) {
@ -352,6 +352,7 @@ ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
``` ```
Scala: Scala:
```scala ```scala
object Solution { object Solution {
def getIntersectionNode(headA: ListNode, headB: ListNode): ListNode = { def getIntersectionNode(headA: ListNode, headB: ListNode): ListNode = {