Skip to content

Commit d9d3f57

Browse files
gazeldxgazeldx
committed
Used language.safe_language_name.
1 parent a127a62 commit d9d3f57

38 files changed

+68
-68
lines changed

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

+2-2
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

+1-1
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

+2-2
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

+1-1
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
public class Solution
173173
{
174174
HashSet<int> appearedNums = new HashSet<int>();

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

+2-2
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

+2-2
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

+1-1
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
public class Solution
176176
{
177177
public int MinSubArrayLen(int target, int[] nums)

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

+2-2
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

+1-1
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
public class Solution
113113
{
114114
public bool IsAnagram(string s, string t)

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

+4-4
Original file line numberDiff line numberDiff line change
@@ -131,7 +131,7 @@ class Solution:
131131

132132
## C++
133133

134-
```c++
134+
```cpp
135135
class Solution {
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
public class Solution
193193
{
194194
public int RemoveElement(int[] nums, int val)
@@ -328,7 +328,7 @@ class Solution:
328328

329329
## C++
330330

331-
```c++
331+
```cpp
332332
class Solution {
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
public class Solution
370370
{
371371
public int RemoveElement(int[] nums, int val)

‎en/1-1000/303-range-sum-query-immutable.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -86,7 +86,7 @@ class NumArray:
8686

8787
## C++
8888

89-
```c++
89+
```cpp
9090
class NumArray {
9191
private:
9292
vector<int> prefixSums;
@@ -130,7 +130,7 @@ NumArray.prototype.sumRange = function (left, right) {
130130

131131
## C#
132132

133-
```c#
133+
```csharp
134134
public class NumArray
135135
{
136136
int[] prefixSums;

‎en/1-1000/344-reverse-string.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -120,7 +120,7 @@ class Solution:
120120

121121
## C++
122122

123-
```c++
123+
```cpp
124124
class Solution {
125125
public:
126126
void reverseString(vector<char>& s) {
@@ -155,7 +155,7 @@ var reverseString = function (s) {
155155

156156
## C#
157157

158-
```c#
158+
```csharp
159159
public class Solution
160160
{
161161
public void ReverseString(char[] s)

‎en/1-1000/349-intersection-of-two-arrays.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -82,7 +82,7 @@ class Solution:
8282

8383
## C++
8484

85-
```c++
85+
```cpp
8686
class Solution {
8787
public:
8888
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
@@ -119,7 +119,7 @@ var intersection = function (nums1, nums2) {
119119

120120
## C#
121121

122-
```c#
122+
```csharp
123123
public class Solution
124124
{
125125
public int[] Intersection(int[] nums1, int[] nums2)

‎en/1-1000/383-ransom-note.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -149,7 +149,7 @@ var canConstruct = function (ransomNote, magazine) {
149149

150150
## C#
151151

152-
```c#
152+
```csharp
153153
public class Solution
154154
{
155155
public bool CanConstruct(string ransomNote, string magazine)

‎en/1-1000/454-4sum-ii.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -151,7 +151,7 @@ var fourSumCount = function (nums1, nums2, nums3, nums4) {
151151

152152
## C#
153153

154-
```c#
154+
```csharp
155155
public class Solution
156156
{
157157
public int FourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] nums4)

‎en/1-1000/59-spiral-matrix-ii.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -210,7 +210,7 @@ function getIncrement(i, j) {
210210

211211
## C#
212212

213-
```c#
213+
```csharp
214214
public class Solution
215215
{
216216
int[][] matrix;

‎en/1-1000/704-binary-search.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -98,7 +98,7 @@ class Solution:
9898

9999
## C++
100100

101-
```c++
101+
```cpp
102102
class Solution {
103103
public:
104104
int search(vector<int>& nums, int target) {
@@ -151,7 +151,7 @@ var search = function (nums, target) {
151151

152152
## C#
153153

154-
```c#
154+
```csharp
155155
public class Solution
156156
{
157157
public int Search(int[] nums, int target)

‎en/1-1000/707-design-linked-list.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -283,7 +283,7 @@ MyLinkedList.prototype.deleteAtIndex = function (index) {
283283

284284
## C#
285285

286-
```c#
286+
```csharp
287287
public class ListNode
288288
{
289289
public int val;

‎en/1-1000/977-squares-of-a-sorted-array.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -96,7 +96,7 @@ class Solution:
9696

9797
## C++
9898

99-
```c++
99+
```cpp
100100
class Solution {
101101
public:
102102
vector<int> sortedSquares(vector<int>& nums) {
@@ -149,7 +149,7 @@ var sortedSquares = function (nums) {
149149

150150
## C#
151151

152-
```c#
152+
```csharp
153153
public class Solution
154154
{
155155
public int[] SortedSquares(int[] nums)
@@ -275,7 +275,7 @@ class Solution:
275275

276276
## C++
277277

278-
```c++
278+
```cpp
279279
class Solution {
280280
public:
281281
vector<int> sortedSquares(vector<int>& nums) {
@@ -302,7 +302,7 @@ var sortedSquares = function (nums) {
302302

303303
## C#
304304

305-
```c#
305+
```csharp
306306
public class Solution
307307
{
308308
public int[] SortedSquares(int[] nums)

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -181,7 +181,7 @@ class Solution:
181181

182182
## C++
183183

184-
```c++
184+
```cpp
185185
class Solution {
186186
public:
187187
vector<int> twoSum(vector<int>& nums, int target) {
@@ -218,7 +218,7 @@ var twoSum = function (nums, target) {
218218

219219
## C#
220220

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

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -263,7 +263,7 @@ var getIntersectionNode = function (headA, headB) {
263263

264264
## C#
265265

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

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

+2-2
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 {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -167,7 +167,7 @@ var isHappy = function (n, appearedNums) {
167167

168168
## C#
169169

170-
```c#
170+
```csharp
171171
public class Solution
172172
{
173173
HashSet<int> appearedNums = new HashSet<int>();

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -109,7 +109,7 @@ class Solution:
109109

110110
## C++
111111

112-
```c++
112+
```cpp
113113
/**
114114
* Definition for singly-linked list.
115115
* struct ListNode {
@@ -171,7 +171,7 @@ var removeElements = function (head, val) {
171171

172172
## C#
173173

174-
```c#
174+
```csharp
175175
/**
176176
* Definition for singly-linked list.
177177
* public class ListNode {

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -143,7 +143,7 @@ class Solution:
143143

144144
## C++
145145

146-
```c++
146+
```cpp
147147
/**
148148
* struct ListNode {
149149
* int val;
@@ -197,7 +197,7 @@ var reverseList = function (head) {
197197

198198
## C#
199199

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

0 commit comments

Comments
 (0)