用比較高效的方法去算 array

x86driver · May 28, 2012 · 0309a17 · 0309a17
1 parent 68dc267
commit 0309a17
Showing 1 changed file with 3 additions and 1 deletion.
diff --git a/count.c b/count.c
@@ -2,7 +2,7 @@
 
 int main()
 {
-    int numbers[] = {1, 3, 3, 4, 4, 4, 4, 4};
+    int numbers[] = {1, 2, 2, 2, 3, 3, 4, 4, 4, 5};
     int total = sizeof(numbers) / sizeof(numbers[0]);
     int sum = 0;
 
@@ -11,6 +11,8 @@ int main()
     i = 0;
     while (i < total) {
         int comp = numbers[i];
+        sum = numbers[i];
+        ++i;
         for (; i < total; ++i) {
             int curr = numbers[i];
             if (comp == curr) {