File tree 7 files changed +8
-8
lines changed
7 files changed +8
-8
lines changed Original file line number Diff line number Diff line change 1
1
CC = gcc
2
2
CXX = g++
3
- CFLAGS = -std=c99 -Wall
3
+ CFLAGS = -std=c99 -Wall -lm
4
4
CXXFLAGS = -std=c++11 -Wall
5
5
6
6
C_SRCS = $(wildcard src/* .c)
Original file line number Diff line number Diff line change @@ -34,7 +34,7 @@ int hash(int key) {
34
34
return index > 0 ? index : (- index );
35
35
}
36
36
37
- struct node_t * findAndAdjust (key ) {
37
+ struct node_t * findAndAdjust (int key ) {
38
38
int index = hash (key );
39
39
struct node_t * p = m_lru .hash_table [index ];
40
40
while (p ) {
Original file line number Diff line number Diff line change @@ -24,8 +24,8 @@ int findPeakElement(int* nums, int numsSize) {
24
24
25
25
int main () {
26
26
int nums0 [] = { 1 , 2 , 3 , 1 };
27
- int nums0 [] = { 1 , 2 };
28
- assert (findPeakElement (sizeof (nums0 ) / sizeof (nums0 [0 ])) == 2 );
29
- assert (findPeakElement (sizeof (nums1 ) / sizeof (nums1 [0 ])) == 1 );
27
+ int nums1 [] = { 1 , 2 };
28
+ assert (findPeakElement (nums0 , sizeof (nums0 ) / sizeof (nums0 [0 ])) == 2 );
29
+ assert (findPeakElement (nums1 , sizeof (nums1 ) / sizeof (nums1 [0 ])) == 1 );
30
30
return 0 ;
31
31
}
Original file line number Diff line number Diff line change 1
1
#include <stdio.h>
2
2
#include <stdlib.h>
3
+ #include <assert.h>
3
4
4
5
#define max (a ,b ) ((a)>(b)?(a):(b))
5
6
int robNoCircle (int num [], int n ) {
Original file line number Diff line number Diff line change @@ -9,7 +9,6 @@ int nthUglyNumber(int n) {
9
9
int k = 1 ; /* store index */
10
10
11
11
while (k < n ) {
12
- int * index = NULL ;
13
12
int min = 0 ;
14
13
if (nums [i2 ] * 2 <= nums [i3 ] * 3 ) {
15
14
min = nums [i2 ] * 2 ;
@@ -39,7 +38,7 @@ int main() {
39
38
40
39
int n = 10 ;
41
40
int i ;
42
- for (i = 1 ; i <= 10 ; i ++ ) {
41
+ for (i = 1 ; i <= n ; i ++ ) {
43
42
printf ("%d " , nthUglyNumber (i ));
44
43
}
45
44
printf ("\n" );
Original file line number Diff line number Diff line change 3
3
4
4
int firstMissingPositive (int * nums , int numsSize ) {
5
5
int i ;
6
- int flag = 0 ;
7
6
for (i = 0 ; i < numsSize ; i ++ ) {
8
7
while (nums [i ] > 0 && nums [i ] < numsSize && nums [nums [i ] - 1 ] != nums [i ]) {
9
8
int t = nums [i ];
Original file line number Diff line number Diff line change 1
1
#include < iostream>
2
2
#include < vector>
3
3
#include < string>
4
+ #include < algorithm>
4
5
#include < unordered_map>
5
6
6
7
using namespace std ;
You can’t perform that action at this time.
0 commit comments