From f403cbe3c37ed9dbd2adfbb164ecb9d01b1b2017 Mon Sep 17 00:00:00 2001 From: db <39407623+IcePigZDB@users.noreply.github.com> Date: Mon, 20 Dec 2021 15:45:51 +0800 Subject: [PATCH 1/4] =?UTF-8?q?Update=200102.=E4=BA=8C=E5=8F=89=E6=A0=91?= =?UTF-8?q?=E7=9A=84=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 更新错别字 --- problems/0102.二叉树的层序遍历.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md index 7ee6e95c..4fcbbff8 100644 --- a/problems/0102.二叉树的层序遍历.md +++ b/problems/0102.二叉树的层序遍历.md @@ -12,7 +12,7 @@ * 107.二叉树的层次遍历II * 199.二叉树的右视图 * 637.二叉树的层平均值 -* 429.N叉树的前序遍历 +* 429.N叉树的层序遍历 * 515.在每个树行中找最大值 * 116.填充每个节点的下一个右侧节点指针 * 117.填充每个节点的下一个右侧节点指针II From bf8ece20044eb115e5f12c7fd8b08485225a11f6 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E9=99=86=E5=8A=B2=E6=B6=9B?= Date: Tue, 28 Dec 2021 16:39:16 +0800 Subject: [PATCH 2/4] =?UTF-8?q?=E6=B5=8B=E8=AF=95=E4=B8=8D=E5=90=8C?= =?UTF-8?q?=E6=97=B6=E9=97=B4=E5=A4=8D=E6=9D=82=E5=BA=A6=E7=9A=84=E7=A8=8B?= =?UTF-8?q?=E5=BA=8F=E8=BF=90=E8=A1=8C=E6=97=B6=E9=97=B4Java=E7=89=88?= =?UTF-8?q?=E6=9C=AC=E6=B5=8B=E8=AF=95=E4=BB=A3=E7=A0=81?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...时了，此时的n究竟是多大？.md | 55 +++++++++++++++++++ 1 file changed, 55 insertions(+) diff --git a/problems/前序/On的算法居然超时了，此时的n究竟是多大？.md b/problems/前序/On的算法居然超时了，此时的n究竟是多大？.md index 2019e691..9a56937c 100644 --- a/problems/前序/On的算法居然超时了，此时的n究竟是多大？.md +++ b/problems/前序/On的算法居然超时了，此时的n究竟是多大？.md @@ -206,7 +206,62 @@ int main() { } } +``` + +Java版本 +```Java +import java.util.Scanner; + +public class TimeComplexity { + // o(n) + public static void function1(long n) { + System.out.println("o(n)算法"); + long k = 0; + for (long i = 0; i < n; i++) { + k++; + } + } + + // o(n^2) + public static void function2(long n) { + System.out.println("o(n^2)算法"); + long k = 0; + for (long i = 0; i < n; i++) { + for (long j = 0; j < n; j++) { + k++; + } + } + } + + // o(nlogn) + public static void function3(long n) { + System.out.println("o(nlogn)算法"); + long k = 0; + for (long i = 0; i < n; i++) { + for (long j = 1; j < n; j = j * 2) { // 注意这里j=1 + k++; + } + } + } + + public static void main(String[] args) { + while(true) { + Scanner in = new Scanner(System.in); + System.out.print("输入n: "); + int n = in.nextInt(); + long startTime = System.currentTimeMillis(); + + function1(n); + // function2(n); + // function3(n); + + long endTime = System.currentTimeMillis(); + long costTime = endTime - startTime; + System.out.println("算法耗时 == " + costTime + "ms"); + } + } +} ``` # 总结 From 050a498c10aba764efee7ebb4141f96c0cddbda4 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E9=99=86=E5=8A=B2=E6=B6=9B?= Date: Tue, 28 Dec 2021 16:42:31 +0800 Subject: [PATCH 3/4] =?UTF-8?q?=E6=B5=8B=E8=AF=95=E4=B8=8D=E5=90=8C?= =?UTF-8?q?=E6=97=B6=E9=97=B4=E5=A4=8D=E6=9D=82=E5=BA=A6=E7=9A=84=E7=A8=8B?= =?UTF-8?q?=E5=BA=8F=E8=BF=90=E8=A1=8C=E6=97=B6=E9=97=B4Java=E7=89=88?= =?UTF-8?q?=E6=9C=AC=E6=B5=8B=E8=AF=95=E4=BB=A3=E7=A0=81?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/前序/Java处理输入输出.md | 5 +++++ 1 file changed, 5 insertions(+) create mode 100644 problems/前序/Java处理输入输出.md diff --git a/problems/前序/Java处理输入输出.md b/problems/前序/Java处理输入输出.md new file mode 100644 index 00000000..9ddec96d --- /dev/null +++ b/problems/前序/Java处理输入输出.md @@ -0,0 +1,5 @@ +在面试中，我们常常会遇到面试官让我们用某种编程语言做题，并要求能够在本地编译运行。 +这种模式也被称做ACM模式。 + +本文将介绍如何用Java处理输入输出。 + From 8f62ce95bfa6f76b1288bcac8628d1a78cae2e21 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E9=99=86=E5=8A=B2=E6=B6=9B?= Date: Thu, 30 Dec 2021 15:06:23 +0800 Subject: [PATCH 4/4] =?UTF-8?q?=E6=B7=BB=E5=8A=A0Java=E7=89=88=E6=9C=AC?= =?UTF-8?q?=E7=9A=84=E9=93=BE=E8=A1=A8ListNode=E7=B1=BB?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/链表理论基础.md | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/problems/链表理论基础.md b/problems/链表理论基础.md index 0da269f0..02b7029e 100644 --- a/problems/链表理论基础.md +++ b/problems/链表理论基础.md @@ -143,7 +143,30 @@ head->val = 5; Java： +```java +public class ListNode { + // 结点的值 + int val; + // 下一个结点 + ListNode next; + + // 节点的构造函数(无参) + public ListNode() { + } + + // 节点的构造函数(有一个参数) + public ListNode(int val) { + this.val = val; + } + + // 节点的构造函数(有两个参数) + public ListNode(int val, ListNode next) { + this.val = val; + this.next = next; + } +} +``` Python：