Last active
May 14, 2021 14:09
-
-
Save hyuki/cbbd4f2c404fa746c4d621c55c24748f to your computer and use it in GitHub Desktop.
girlnote323-contains.java - Web連載「数学ガールの秘密ノート」 第323回 アルゴリズム、なかなか大変(前編)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// 注意:本文に近付けるため、Javaとしては不自然な書き方になっています | |
// cf: https://cakes.mu/posts/33738 | |
class Node { | |
int value; | |
Node next; | |
public Node(int value, Node next) { | |
this.value = value; | |
this.next = next; | |
} | |
public static Node asNode(int... values) { | |
Node head = new Node(0, null); | |
Node p = head; | |
for (int i = values.length - 1; i >= 0; i--) { | |
p = new Node(values[i], p); | |
} | |
head.next = p; | |
return head; | |
} | |
public static void println(Node head) { | |
Node p = head.next; | |
while (p != head) { | |
System.out.print(p.value); | |
p = p.next; | |
if (p != head) { | |
System.out.print(" → "); | |
} | |
} | |
System.out.println(); | |
} | |
// List 10 | |
public static boolean contains1(Node C, int v) { | |
Node p = C.next; | |
while (p != C) { | |
if (p.value == v) { | |
return true; | |
} | |
p = p.next; | |
} | |
return false; | |
} | |
// List 11 | |
public static boolean contains2(Node C, int v) { | |
C.value = v; | |
Node p = C.next; | |
while (p.value != v) { | |
p = p.next; | |
} | |
if (p == C) { | |
return false; | |
} else { | |
return true; | |
} | |
} | |
public static void main(String[] args) { | |
Node C = asNode(31, 41, 59, 26, 53); | |
println(C); | |
System.out.println("Does <31, 41, 59, 26, 53> contain 59? => " + contains1(C, 59)); | |
System.out.println("Does <31, 41, 59, 26, 53> contain 99? => " + contains1(C, 99)); | |
System.out.println("Does <31, 41, 59, 26, 53> contain 59? => " + contains2(C, 59)); | |
System.out.println("Does <31, 41, 59, 26, 53> contain 99? => " + contains2(C, 99)); | |
} | |
} |
Author
hyuki
commented
May 14, 2021
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment