Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 4419da2

Browse files
committed
fix compiler errors
1 parent f249682 commit 4419da2

File tree

7 files changed

+8
-8
lines changed

7 files changed

+8
-8
lines changed

‎Makefile

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
CC = gcc
22
CXX = g++
3-
CFLAGS = -std=c99 -Wall
3+
CFLAGS = -std=c99 -Wall -lm
44
CXXFLAGS = -std=c++11 -Wall
55

66
C_SRCS = $(wildcard src/*.c)

‎src/146.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,7 @@ int hash(int key) {
3434
return index > 0 ? index : (-index);
3535
}
3636

37-
struct node_t* findAndAdjust(key) {
37+
struct node_t* findAndAdjust(intkey) {
3838
int index = hash(key);
3939
struct node_t *p = m_lru.hash_table[index];
4040
while (p) {

‎src/162.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -24,8 +24,8 @@ int findPeakElement(int* nums, int numsSize) {
2424

2525
int main() {
2626
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);
3030
return 0;
3131
}

‎src/213.c

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
11
#include <stdio.h>
22
#include <stdlib.h>
3+
#include <assert.h>
34

45
#define max(a,b) ((a)>(b)?(a):(b))
56
int robNoCircle(int num[], int n) {

‎src/264.c

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,6 @@ int nthUglyNumber(int n) {
99
int k = 1; /* store index */
1010

1111
while (k < n) {
12-
int *index = NULL;
1312
int min = 0;
1413
if (nums[i2] * 2 <= nums[i3] * 3) {
1514
min = nums[i2] * 2;
@@ -39,7 +38,7 @@ int main() {
3938

4039
int n = 10;
4140
int i;
42-
for (i = 1; i <= 10; i++) {
41+
for (i = 1; i <= n; i++) {
4342
printf("%d ", nthUglyNumber(i));
4443
}
4544
printf("\n");

‎src/41.c

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,6 @@
33

44
int firstMissingPositive(int* nums, int numsSize) {
55
int i;
6-
int flag = 0;
76
for (i = 0; i < numsSize; i++) {
87
while (nums[i] > 0 && nums[i] < numsSize && nums[nums[i] - 1] != nums[i]) {
98
int t = nums[i];

‎src/49.cpp

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
#include <iostream>
22
#include <vector>
33
#include <string>
4+
#include <algorithm>
45
#include <unordered_map>
56

67
using namespace std;

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /