特斯拉pre-test （Go）_you are given an implement of a function solution_an infrastructure consisting of n cities-优快云博客

本文链接：https://blog.youkuaiyun.com/2401_84239901/article/details/137995661

先自我介绍一下，小编浙江大学毕业，去过华为、字节跳动等大厂，目前阿里P7

深知大多数程序员，想要提升技能，往往是自己摸索成长，但自己不成体系的自学效果低效又漫长，而且极易碰到天花板技术停滞不前！

因此收集整理了一份《2024年最新Golang全套学习资料》，初衷也很简单，就是希望能够帮助到想自学提升又不知道该从何学起的朋友。

既有适合小白学习的零基础资料，也有适合3年以上经验的小伙伴深入学习提升的进阶课程，涵盖了95%以上Go语言开发知识点，真正体系化！

由于文件比较多，这里只是将部分目录截图出来，全套包含大厂面经、学习笔记、源码讲义、实战项目、大纲路线、讲解视频，并且后续会持续更新

如果你需要这些资料，可以添加V获取：vip1024b （备注go）

正文

1 Q1

原文：
You are given an implementation of a function Solution that, given a positive integer N, prints to standard output another integer, which was formed by reversing a decimal representation of N. The leading zeros of the resulting integer should not be printed by the function.
Examples:

Given N = 54321, the function should print 12345.
Given N = 10011, the function should print 11001.
Given N = 1, the function should print 1.

The attached code is still incorrect for some inputs. Despite the error(s), the code may produce a correct answer for the example test cases. The goal of the exercise is to find and fix the bug(s) in the implementation. You can modify at most three lines.

Assume that:
N is an integer within the range [1…1,000,000,000].

翻译：

给你一个函数解决方案的实现，给定一个正整数N，将另一个整数打印到标准输出，该整数是通过反转N的十进制表示形式形成的。结果整数的前导零不应由函数打印。
示例：
1.给定N=54321，该函数应打印12345。
2.给定N=10011，函数应该打印11001。
3.给定N=1，函数应该打印1。
附加的代码对于某些输入仍然不正确。尽管有错误，代码可能会为示例测试用例产生正确的答案。练习的目标是找到并修复实现中的bug。您最多可以修改三行。
假设：
N是[1…1,000,000,000]范围内的整数。

截图：
在这里插入图片描述
代码：

package main

import “fmt”

func Solution(N int) {
var enable_print int
enable_print = N % 10
for N > 0 {
if enable_print == 0 && N%10 != 0 {
enable_print = 1
} else if enable_print == 1 {
fmt.Print(N % 10)
}
N = N / 10
}
}

2 Q2

原文：
An infrastructure consisting of N cities, numbered from 1 to N, and M bidirectional roads between them is given. Roads do not intersect apart from at their start and end points (they can pass through underground tunnels to avoid collisions).
For each pair of cities directly connected by a road, let’s define their network rank as the total number of roads that are connected to either of the two cities.
Write a function:
func Solution(A []int, B []int, N int) int
that, given two arrays A, B consisting of M integers each and an integer N, where A[i] and B[i] are cities at the two ends of the i-th road, returns the maximal network rank in the whole infrastructure.
Examples:

Given A = [1, 2, 3, 3], B = [2, 3, 1, 4] and N = 4, the function should return 4. The chosen cities may be 2 and 3, and the four roads connected to them are: (2, 1), (2, 3), (3, 1), (3, 4).
In the pictures below, the chosen cities and roads connected to them are marked in red.
Given A = [1, 2, 4, 5], B = [2, 3, 5, 6] and N = 6, the function should return 2. The chosen cities may be 1 and 2, and the two roads connected to them are: (1, 2), (2, 3).

Write an efficient algorithm for the following assumptions:
N is an integer within the range [2…100];
M is an integer within the range [1…4,950];
each element of arrays A and B is an integer within the range [1…N];
A and B have equal length;
each road connects two distinct cities;
two cities are connected by at most one direct road.