xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-17 17:26:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add Swift language blocks to the docs.

Browse Source
This commit is contained in:
Yudong Jin
2023-01-08 19:41:05 +08:00
parent 3ba37dba3a
commit 73e3452838
22 changed files with 414 additions and 70 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/c/chapter_computational_complexity/worst_best_time_complexity.c
+6 -6
View File
@@ -15,12 +15,12 @@ int *randomNumbers(int n) {
nums[i] = i + 1;
}
// 随机打乱数组元素
for (int i = n - 1; i > 0; i--) {
int j = rand() % (i + 1);
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
for (int i = n - 1; i > 0; i--) {
int j = rand() % (i + 1);
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
return nums;
}
codes/csharp/hello-algo.csproj
+2 -2
View File
@@ -11,8 +11,8 @@
<ItemGroup>
<PackageReference Include="Microsoft.NET.Test.Sdk" Version="17.4.0" />
<PackageReference Include="NUnit" Version="3.13.3" />
<PackageReference Include="NUnit3TestAdapter" Version="4.0.0" />
<PackageReference Include="coverlet.collector" Version="3.1.0" />
<PackageReference Include="NUnit3TestAdapter" Version="4.0.0" />
<PackageReference Include="coverlet.collector" Version="3.1.0" />
</ItemGroup>
</Project>
codes/swift/chapter_array_and_linkedlist/array.swift
+6 -6
View File
@@ -4,7 +4,7 @@
* Author: nuomi1 (nuomi1@qq.com)
*/
// 随机返回一个数组元素
/* 随机返回一个数组元素 */
func randomAccess(nums: [Int]) -> Int {
// 在区间 [0, nums.count) 中随机抽取一个数字
let randomIndex = nums.indices.randomElement()!
@@ -13,7 +13,7 @@ func randomAccess(nums: [Int]) -> Int {
return randomNum
}
// 扩展数组长度
/* 扩展数组长度 */
func extend(nums: [Int], enlarge: Int) -> [Int] {
// 初始化一个扩展长度后的数组
var res = Array(repeating: 0, count: nums.count + enlarge)
@@ -25,7 +25,7 @@ func extend(nums: [Int], enlarge: Int) -> [Int] {
return res
}
// 在数组的索引 index 处插入元素 num
/* 在数组的索引 index 处插入元素 num */
func insert(nums: inout [Int], num: Int, index: Int) {
// 把索引 index 以及之后的所有元素向后移动一位
for i in sequence(first: nums.count - 1, next: { $0 > index + 1 ? $0 - 1 : nil }) {
@@ -35,7 +35,7 @@ func insert(nums: inout [Int], num: Int, index: Int) {
nums[index] = num
}
// 删除索引 index 处元素
/* 删除索引 index 处元素 */
func remove(nums: inout [Int], index: Int) {
let count = nums.count
// 把索引 index 之后的所有元素向前移动一位
@@ -44,7 +44,7 @@ func remove(nums: inout [Int], index: Int) {
}
}
// 遍历数组
/* 遍历数组 */
func traverse(nums: [Int]) {
var count = 0
// 通过索引遍历数组
@@ -57,7 +57,7 @@ func traverse(nums: [Int]) {
}
}
// 在数组中查找指定元素
/* 在数组中查找指定元素 */
func find(nums: [Int], target: Int) -> Int {
for i in nums.indices {
if nums[i] == target {