From e869aac4d7868d522ea52ad1421de2ea787fca02 Mon Sep 17 00:00:00 2001 From: phil Date: Sat, 9 Apr 2022 18:22:04 +0800 Subject: [PATCH 1/2] 4/9 --- .../\344\270\200\351\235\242.md" | 28 +++++++++++++++++++ 1 file changed, 28 insertions(+) diff --git "a/\345\215\216\344\270\272/\344\270\200\351\235\242.md" "b/\345\215\216\344\270\272/\344\270\200\351\235\242.md" index cd23774..4023b2f 100644 --- "a/\345\215\216\344\270\272/\344\270\200\351\235\242.md" +++ "b/\345\215\216\344\270\272/\344\270\200\351\235\242.md" @@ -124,3 +124,31 @@ NO YES + + + + +# 华为 数字化应用it 主管面 20min + +### 你目前是想走向工作呢还是想继续深造? + +### 能够实习多久? + +### 控制优化和你现在做的这个方向有什么联系?或者说你是按照你的职业规划来做的? + +### 能给我讲讲这两个项目吗? + +### 讲讲你负责的这一部分的技术点是怎么样的? + +### 讲讲在做这个项目中你碰到的一些困难,你是怎么克服的? + +### 前后端分离你有没有考虑过一些容易被攻击的一些点?怎么解决的? + +### 你的课后生活,比如爱好特长什么的? + +### 有什么社会实践什么的? + +### 在做志愿者的时候你有什么收获? + +### 你对狼性文化是怎么看的? + -- Gitee From af2f9c1e0d794030e1a3fa6cf678e28a01079fc0 Mon Sep 17 00:00:00 2001 From: Tony Date: Mon, 18 Apr 2022 10:40:53 +0800 Subject: [PATCH 2/2] =?UTF-8?q?[feature]=20=E6=B7=BB=E5=8A=A0=E4=BA=86?= =?UTF-8?q?=E7=AC=AC=E4=B8=80=E9=A2=98=E7=9A=84=E7=AD=94=E6=A1=88?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- NetEase/NetEase.md | 54 +++++++++++++++++++++++++++++++++++++++++++++- 1 file changed, 53 insertions(+), 1 deletion(-) diff --git a/NetEase/NetEase.md b/NetEase/NetEase.md index 9d13d51..7bf6956 100644 --- a/NetEase/NetEase.md +++ b/NetEase/NetEase.md @@ -1,4 +1,56 @@ -# 1. 输入数组长度n,最大值k,总和x。求这个数组。不存在返回-1 +# 1. 输入数组长度n,最大值k,总和x。求这个数组,数组中元素不可重复。不存在返回-1 + +```java +public class Test002 { + public static void main(String[] args) { + Scanner sc = new Scanner(System.in); + int n = sc.nextInt(); + int k = sc.nextInt(); + int x = sc.nextInt(); + int[] arr = new int[k]; + + for (int i = 0; i < arr.length; i++) { + arr[i] = i+1; + } + boolean[] s = new boolean[k]; + List> res = new ArrayList<>(); + backTracing(arr, n, x, s,new ArrayList(), res, 0); + if (res.size() == 0) System.out.println(-1); + else System.out.println(res.get(0)); + } + + public static void backTracing(int[] arr, int len, int aim, + boolean[] s, + List path, + List> res, + int depth) { + if (len == depth) { + int sum = 0; + for (Integer value : path) { + sum += value; + } + if (sum == aim) { + res.add(new ArrayList<>(path)); + } + return; + } + + for (int i = 0; i < arr.length; i++) { + if (!used[i]) { + path.add(arr[i]); + s[i] = true; + backTracing(arr, len, target, used, path, res, depth + 1); + s[i] = false; + path.remove(path.size() - 1); + } + } + } +} +``` + + + + -- Gitee