Berkeley CS 61B Data Structures(in Java) Homework3 加分+讨论帖

Howie 发表于 2014-12-27 14:54
大家都是怎么做第一个的啊。我感觉我做的好复杂啊！！！
对于每个元素，看后面那个是否和他相等，相等的 ...

Use currentIndex to store the first index of consecutive items.
Use i to iterate through the array.

if i.item != currentIndex.item
    then set the item of currentIndex.next to i.item
    and currentIndex++

After one iteration, the currentIndex will become the last meanful item in the new array.
then just set every item after currentIndex to -1.(in LinkedList version, just need to set currentIndex.next to null)


The code look like this:

1.            int currentIndex = 0;
   
2.            for (int i = 1; i < ints.length; i++) {
   
3.                if (ints[currentIndex] != ints[i]) {
   
4.                    ints[currentIndex + 1] = ints[i];
   
5.                    currentIndex++;
   
6.                }
   
7.            }
   
8.            for (int i = currentIndex + 1; i < ints.length; i++) {
   
9.                ints[i] = -1;
   
10.            }

复制代码

啦啦啦啦啦啦啦啦啦啦

Data transfer by value and by address part is quite interesting!

down by eclipse

My Homework 3~~

今日已经无法上传这么大的附件。。。。orz

话说大家都好好的read了每节课的reading吗？ 感觉坚持reading比坚持上课、lab、作业都难。。。

交作业咯～～

第三次作业~

homework 3 完成～～求楼主加分～

交作业~ 最近出了上课写作业的时间都用来学这门课了