01204212/like - ประวัติรุ่นแก้ไข

Jittat: /* Code for your own implementation of binary search trees */

2016-10-06T04:48:53Z

Code for your own implementation of binary search trees

Jittat: /* Code */

2016-10-06T04:47:06Z

Code

Jittat: /* Code */

2016-09-22T04:05:29Z

Code

Jittat: /* Test data */

2016-09-22T04:04:55Z

Test data

Jittat เมื่อ 01:49, 22 กันยายน 2559

2016-09-22T01:49:31Z

Jittat เมื่อ 21:09, 21 กันยายน 2559

2016-09-21T21:09:34Z

Jittat เมื่อ 21:07, 21 กันยายน 2559

2016-09-21T21:07:46Z

Jittat: หน้าที่ถูกสร้างด้วย ': ''This is part of 01204212'' You want to keep track of the number of "likes" each status has. In the beginning, every status ha...'

2016-09-21T21:06:04Z

หน้าที่ถูกสร้างด้วย ': ''This is part of 01204212'' You want to keep track of the number of "likes" each status has. In the beginning, every status ha...'

หน้าใหม่

: ''This is part of [[01204212]]''

You want to keep track of the number of "likes" each status has. In the beginning, every status has 0 likes.

@@ แถว 104: / แถว 104: @@
 <syntaxhighlight lang="java">
 public class TreeNode {
      public int val;
      public TreeNode leftChild;
      public TreeNode rightChild;
-     public TreeNode(int v) {
+     public TreeNode(int k, int v) {
          val = v;
          leftChild = rightChild = null;
@@ แถว 117: / แถว 119: @@
 === An example of find ===
 <syntaxhighlight lang="java">
-     private TreeNode find(TreeNode node, int val) {
+     private TreeNode find(TreeNode node, int key) {
          if(node == null) {
              return null;
+         }
-         if(node.val == val) {
+         if(node.key == key) {
              return node;
-         } else if(node.val < val) {
+         } else if(node.key < key) {
-             return find(node.rightChild, val);
+             return find(node.rightChild, key);
          } else {
-             return find(node.leftChild, val);
+             return find(node.leftChild, key);
+         }
+     }
 </syntaxhighlight>

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 04:47, 6 ตุลาคม 2559
แถว 99:		แถว 99:

	You can use the same Main class from task [[01204212/id request\|ID request]]		You can use the same Main class from task [[01204212/id request\|ID request]]
		+
		+	== Code for your own implementation of binary search trees ==
		+	=== TreeNode ===
		+	<syntaxhighlight lang="java">
		+	public class TreeNode {
		+	public int val;
		+	public TreeNode leftChild;
		+	public TreeNode rightChild;
		+
		+	public TreeNode(int v) {
		+	val = v;
		+	leftChild = rightChild = null;
		+	}
		+	}
		+	</syntaxhighlight>
		+
		+	=== An example of find ===
		+	<syntaxhighlight lang="java">
		+	private TreeNode find(TreeNode node, int val) {
		+	if(node == null) {
		+	return null;
		+	}
		+	if(node.val == val) {
		+	return node;
		+	} else if(node.val < val) {
		+	return find(node.rightChild, val);
		+	} else {
		+	return find(node.leftChild, val);
		+	}
		+	}
		+	</syntaxhighlight>

@@ แถว 93: / แถว 93: @@
 == Code ==
-Collections:  you will have to use [https://docs.oracle.com/javase/7/docs/api/java/util/Map.html the Map interface].  These are implementations:
+'''Collections:'''  you will have to use [https://docs.oracle.com/javase/7/docs/api/java/util/Map.html the Map interface].  These are implementations:
 * [https://docs.oracle.com/javase/7/docs/api/java/util/TreeMap.html TreeMap]
 * [http://docs.oracle.com/javase/7/docs/api/java/util/HashMap.html HashMap]

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 04:04, 22 กันยายน 2559
แถว 90:		แถว 90:
	1		1
	</pre>		</pre>
		+
		+	== Code ==
		+
		+	Collections: you will have to use [https://docs.oracle.com/javase/7/docs/api/java/util/Map.html the Map interface]. These are implementations:
		+
		+	* [https://docs.oracle.com/javase/7/docs/api/java/util/TreeMap.html TreeMap]
		+	* [http://docs.oracle.com/javase/7/docs/api/java/util/HashMap.html HashMap]

@@ แถว 11: / แถว 11: @@
 There are '''N''' lines of output, each contains the current number of likes the post ID '''x''' has so far (including this one).
 == Example ==
@@ แถว 52: / แถว 50: @@
 Download at: [http://theory.cpe.ku.ac.th/~jittat/courses/01204212/tasks/id-requests/ here]

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 21:09, 21 กันยายน 2559
แถว 11:		แถว 11:

	There are '''N''' lines of output, each contains the current number of likes the post ID '''x''' has so far (including this one).		There are '''N''' lines of output, each contains the current number of likes the post ID '''x''' has so far (including this one).
		+
		+	== Example ==
		+
		+	== Example ==
		+
		+	'''Input'''
		+
		+	<pre>
		+	10
		+	4
		+	2
		+	4
		+	10
		+	100
		+	30
		+	10
		+	35
		+	4
		+	200
		+	</pre>
		+
		+	'''Output'''
		+
		+	<pre>
		+	1
		+	1
		+	2
		+	1
		+	1
		+	1
		+	2
		+	1
		+	3
		+	1
		+	</pre>
		+
		+	== Test data ==
		+
		+	Use the test data for [[01204212/id request\|ID requests]]
		+
		+	Download at: [http://theory.cpe.ku.ac.th/~jittat/courses/01204212/tasks/id-requests/ here]

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 21:07, 21 กันยายน 2559
แถว 1:		แถว 1:
	: ''This is part of [[01204212]]''		: ''This is part of [[01204212]]''

−	You want to keep track of the number of "likes" each status has. In the beginning, every status has 0 likes.	+	You want to keep track of the number of "likes" each status has. In the beginning, every status has 0 likes. You are given a sequence of like clicks (as a sequence of status IDs).
		+
		+	'''Input'''
		+
		+	* First line: an integer '''N''' (1<='''N'''<=100,000)
		+	* The next '''N''' lines: each line contains an integer '''x''', the ID of the post clicked.
		+
		+	'''Output'''
		+
		+	There are '''N''' lines of output, each contains the current number of likes the post ID '''x''' has so far (including this one).