Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitd9d3f57

Browse files
committed
Usedlanguage.safe_language_name.
1 parenta127a62 commitd9d3f57

File tree

38 files changed

+68
-68
lines changed

38 files changed

+68
-68
lines changed

‎en/1-1000/1-two-sum.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -182,7 +182,7 @@ class Solution:
182182

183183
##C++
184184

185-
```c++
185+
```cpp
186186
class Solution {
187187
public:
188188
vector<int> twoSum(vector<int>& nums, int target) {
@@ -219,7 +219,7 @@ var twoSum = function (nums, target) {
219219

220220
##C#
221221

222-
```c#
222+
```csharp
223223
public class Solution {
224224
public int[] TwoSum(int[] nums, int target) {
225225
var numToIndex = new Dictionary<int, int>();

‎en/1-1000/160-intersection-of-two-linked-lists.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -264,7 +264,7 @@ var getIntersectionNode = function (headA, headB) {
264264

265265
##C#
266266

267-
```c#
267+
```csharp
268268
/**
269269
* public class ListNode {
270270
* public int val;

‎en/1-1000/19-remove-nth-node-from-end-of-list.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -175,7 +175,7 @@ class Solution:
175175

176176
##C++
177177

178-
```c++
178+
```cpp
179179
/**
180180
* Definition for singly-linked list.
181181
* struct ListNode {
@@ -254,7 +254,7 @@ var removeNthFromEnd = function (head, n) {
254254

255255
##C#
256256

257-
```c#
257+
```csharp
258258
/**
259259
* Definition for singly-linked list.
260260
* public class ListNode {

‎en/1-1000/202-happy-number.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -168,7 +168,7 @@ var isHappy = function (n, appearedNums) {
168168

169169
##C#
170170

171-
```c#
171+
```csharp
172172
publicclassSolution
173173
{
174174
HashSet<int>appearedNums=newHashSet<int>();

‎en/1-1000/203-remove-linked-list-elements.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -111,7 +111,7 @@ class Solution:
111111

112112
##C++
113113

114-
```c++
114+
```cpp
115115
/**
116116
* Definition for singly-linked list.
117117
* struct ListNode {
@@ -173,7 +173,7 @@ var removeElements = function (head, val) {
173173

174174
##C#
175175

176-
```c#
176+
```csharp
177177
/**
178178
* Definition for singly-linked list.
179179
* public class ListNode {

‎en/1-1000/206-reverse-linked-list.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -144,7 +144,7 @@ class Solution:
144144

145145
##C++
146146

147-
```c++
147+
```cpp
148148
/**
149149
* struct ListNode {
150150
* int val;
@@ -198,7 +198,7 @@ var reverseList = function (head) {
198198

199199
##C#
200200

201-
```c#
201+
```csharp
202202
/**
203203
* public class ListNode {
204204
* public int val;

‎en/1-1000/209-minimum-size-subarray-sum.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -171,7 +171,7 @@ var minSubArrayLen = function (target, nums) {
171171

172172
##C#
173173

174-
```c#
174+
```csharp
175175
publicclassSolution
176176
{
177177
publicintMinSubArrayLen(inttarget,int[]nums)

‎en/1-1000/24-swap-nodes-in-pairs.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -197,7 +197,7 @@ class Solution:
197197

198198
##C++
199199

200-
```c++
200+
```cpp
201201
/**
202202
* struct ListNode {
203203
* int val;
@@ -264,7 +264,7 @@ var swapPairs = function (head) {
264264

265265
##C#
266266

267-
```c#
267+
```csharp
268268
/**
269269
* public class ListNode {
270270
* public int val;

‎en/1-1000/242-valid-anagram.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -108,7 +108,7 @@ var isAnagram = function (s, t) {
108108

109109
##C#
110110

111-
```c#
111+
```csharp
112112
publicclassSolution
113113
{
114114
publicboolIsAnagram(strings,stringt)

‎en/1-1000/27-remove-element.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -131,7 +131,7 @@ class Solution:
131131

132132
##C++
133133

134-
```c++
134+
```cpp
135135
classSolution {
136136
public:
137137
int removeElement(vector<int>& nums, int val) {
@@ -188,7 +188,7 @@ var removeElement = function (nums, val) {
188188

189189
##C#
190190

191-
```c#
191+
```csharp
192192
publicclassSolution
193193
{
194194
publicintRemoveElement(int[]nums,intval)
@@ -328,7 +328,7 @@ class Solution:
328328

329329
##C++
330330

331-
```c++
331+
```cpp
332332
classSolution {
333333
public:
334334
int removeElement(vector<int>& nums, int val) {
@@ -365,7 +365,7 @@ var removeElement = function (nums, val) {
365365

366366
##C#
367367

368-
```c#
368+
```csharp
369369
publicclassSolution
370370
{
371371
publicintRemoveElement(int[]nums,intval)

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp