当前位置:网站首页>Interview questions shared in today's group
Interview questions shared in today's group
2022-07-01 19:46:00 【Wang yuanrou】
List of articles
As usual , Click on the learning exchange group before going to bed , Today, there was no fishing in the Group , Discussing interview questions , It immediately brought up my interest , Crouched for a while , I sent three interview questions , I tried it .
1
topic


My solution
let arr = [4, 5, 5, 3, 2, 8, 7];
let arr2 = [60, 90, 80, 110, 120, 90, 100, 90, 100, 100];
const fn = function(arr) {
let min = arr[arr.length - 1];
let result = [];
arr.reverse().forEach((item, index) => {
if (item <= min) {
min = item;
result.push(arr.length - 1 - index);
}
});
return result.reverse();
};
console.log(fn(arr));
console.log(fn(arr2));
2.
topic


My solution
const arr = [1, 2, 3, 4, 1, 2];
const obj2 = {
value: 0,
child: [],
};
const fn = function(arr, obj) {
if (arr.length >= 2) {
obj.child.push({
value: arr[0], child: [] });
obj.child.push({
value: arr[1], child: [] });
fn(arr.slice(2, arr.length), obj.child[0]);
fn(arr.slice(3, arr.length), obj.child[1]);
} else if (arr.length === 1) {
obj.child.push({
value: arr[0], child: [] });
fn(arr.slice(2, arr.length), obj.child[0]);
}
};
fn(arr, obj2);
console.log(obj2);
const arr2 = [];
const fn2 = function(obj2, sum) {
sum = sum + obj2.value;
if (obj2.child.length === 1) {
fn2(obj2.child[0], sum);
} else if (obj2.child.length === 2) {
fn2(obj2.child[0], sum);
fn2(obj2.child[1], sum);
} else {
arr2.push(sum);
}
};
fn2(obj2, 0);
console.log(arr2.sort()[arr2.length - 1]);
3.
topic

My thoughts
When you give me this question , What I think of is the public longest substring in the query string
So as to get the start coordinate or end coordinate of the modified content
And then intercept it 0 A string from the start coordinate or the end coordinate to the maximum length of the string
Query the public longest substring again
In this way, you can get the start and end coordinates of the modified content
Then cut this paragraph out to be the content you modified

Code implementation follow-up
边栏推荐
猜你喜欢
![P2433 [deep foundation 1-2] primary school mathematics n in one](/img/28/e5eab8927694ea002b536202a1b5ea.png)
P2433 [deep foundation 1-2] primary school mathematics n in one

Salesmartly has some tricks for Facebook chat!

Class loading mechanism

SQL 入门计划-1-选择

为定时器和延时器等其它情况的回调函数绑定当前作用域的this

Image acquisition and playback of coaxpress high speed camera based on pxie interface

A brief understanding of white box encryption technology

Procédure de mesure du capteur d'accord vibrant par le module d'acquisition d'accord vibrant

Uni app wechat applet one click login to obtain permission function

GB28181之SIP协议
随机推荐
Use the uni app demo provided by Huanxin to quickly realize one-on-one chat
How to add transactions in JDBC
音频编解码基础知识
Salesmartly has some tricks for Facebook chat!
The key to the success of digital transformation enterprises is to create value with data
Ffmpeg common commands (2)
Optaplanner learning notes (I) case cloud balance
GC garbage collection
一个程序员如何快速成长
Shell advanced
Shell高级进阶
Ffmpeg avframe to cv:: mat
Why must we move from Devops to bizdevops?
Object creation
February 15, 2022: sweeping robot. There is a floor sweeping robot in the room (represented by a grid). Each grid in the grid has two possibilities: empty and obstacles. The sweeping robot provides fo
Basic knowledge of audio coding and decoding
通过js实现金字塔(星号金字塔,回文对称数字金字塔)
振弦采集模块测量振弦传感器的流程步骤
新窗口打开页面-window.open
Leetcode 1380 lucky numbers in matrix [array] the leetcode path of heroding