algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 22:28:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

delete system info output in zig codes

Browse Source
This commit is contained in:
sjinzh
2023-01-11 12:34:54 +08:00
parent 749570da0d
commit 3e9edf7115
4 changed files with 0 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/zig/chapter_computational_complexity/leetcode_two_sum.zig
View File

@ -44,10 +44,6 @@ const SolutionHashMap = struct {
// Driver Code // Driver Code
pub fn main() !void { pub fn main() !void {
// 查看本地CPU架构和操作系统信息
var native_target_info = try std.zig.system.NativeTargetInfo.detect(std.zig.CrossTarget{});
std.debug.print("Native Info: CPU Arch = {}, OS = {}\n", .{native_target_info.target.cpu.arch, native_target_info.target.os.tag});
// ======= Test Case ======= // ======= Test Case =======
var nums = [_]i32{ 2, 7, 11, 15 }; var nums = [_]i32{ 2, 7, 11, 15 };
var target: i32 = 9; var target: i32 = 9;

4
codes/zig/chapter_computational_complexity/space_complexity.zig
View File

@ -102,10 +102,6 @@ fn buildTree(mem_allocator: std.mem.Allocator, n: i32) !?*inc.TreeNode(i32) {
// Driver Code // Driver Code
pub fn main() !void { pub fn main() !void {
// 查看本地CPU架构和操作系统信息
var native_target_info = try std.zig.system.NativeTargetInfo.detect(std.zig.CrossTarget{});
std.debug.print("Native Info: CPU Arch = {}, OS = {}\n", .{native_target_info.target.cpu.arch, native_target_info.target.os.tag});
const n: i32 = 5; const n: i32 = 5;
// 常数阶 // 常数阶
constant(n); constant(n);

4
codes/zig/chapter_computational_complexity/time_complexity.zig
View File

@ -141,10 +141,6 @@ fn factorialRecur(n: i32) i32 {
// Driver Code // Driver Code
pub fn main() !void { pub fn main() !void {
// 查看本地CPU架构和操作系统信息
var native_target_info = try std.zig.system.NativeTargetInfo.detect(std.zig.CrossTarget{});
std.debug.print("Native Info: CPU Arch = {}, OS = {}\n", .{native_target_info.target.cpu.arch, native_target_info.target.os.tag});
// 可以修改 n 运行，体会一下各种复杂度的操作数量变化趋势 // 可以修改 n 运行，体会一下各种复杂度的操作数量变化趋势
const n: i32 = 8; const n: i32 = 8;
std.debug.print("输入数据大小 n = {}\n", .{n}); std.debug.print("输入数据大小 n = {}\n", .{n});

4
codes/zig/chapter_computational_complexity/worst_best_time_complexity.zig
View File

@ -28,10 +28,6 @@ pub fn findOne(nums: []i32) i32 {
// Driver Code // Driver Code
pub fn main() !void { pub fn main() !void {
// 查看本地CPU架构和操作系统信息
var native_target_info = try std.zig.system.NativeTargetInfo.detect(std.zig.CrossTarget{});
std.debug.print("Native Info: CPU Arch = {}, OS = {}\n", .{native_target_info.target.cpu.arch, native_target_info.target.os.tag});
var i: i32 = 0; var i: i32 = 0;
while (i < 10) : (i += 1) { while (i < 10) : (i += 1) {
const n: usize = 100; const n: usize = 100;