push homework

2023/homework/mingsenyang/leetcode162.c

@@ -0,0 +1,17 @@
+int findPeakElement(int* nums, int numsSize) {
+    int start =0;
+    int end=numsSize-1;
+    int mid;
+    while (start<end) {
+        // 二分法查找
+        mid = (start + end) /2;
+        // 更新end值
+        if (nums[mid] > nums[mid+1]) {
+            end = mid;
+        } else {
+            // 更新start值
+            start = mid+1;
+        }
+    }
+    return start;
+}

2023/homework/mingsenyang/leetcode1784.c

@@ -0,0 +1,22 @@
+bool checkOnesSegment(char* s) {
+    int len;
+    len = strlen(s);
+    int i=0;
+    int cnt =0;
+    while (i<len) {
+        if (s[i]=='1') {
+            // 连续的1字符个数+1
+            cnt++;
+            // 超过2个直接返回
+            if (cnt>=2) {
+                return false;
+            }
+            while (i<len && s[i]=='1') {
+                i++;
+            }
+        }else {
+            i++;
+        }
+    }
+    return true;
+}

2023/homework/mingsenyang/leetcode1869.c

@@ -0,0 +1,36 @@
+bool checkZeroOnes(char* s) {
+    int len;
+    len = strlen(s);
+    char pre=' ';
+    char cur=' ';
+    int max1 = 0;
+    int max0 = 0;
+    int cnt = 0;
+    for (int i=0; i<=len; i++) {
+        if (i==len) {
+            cur = ' ';
+        } else {
+            cur = s[i];
+        }
+        if (pre!= s[i]) {
+            // 当前字符跟前一个字符不同
+            if (pre=='0') {
+                if (cnt>max0) {
+                    // 更新0字符最大长度
+                    max0 = cnt;
+                }
+            }
+            if (pre=='1') {
+                if (cnt>max1) {
+                    // 更新1字符最大长度
+                    max1 = cnt;
+                }
+            }
+            pre = s[i];
+            cnt = 1;
+        }else {
+            cnt++;
+        }
+    }
+    return max1>max0;
+}

2023/homework/mingsenyang/leetcode434.c

@@ -0,0 +1,22 @@
+int countSegments(char * s){
+    int len,cnt;
+    len = strlen(s);
+    cnt = 0;
+    //遍历字符串
+    for (int i =0; i<len;) {
+        // 跳过空格字符
+        if (s[i] == ' ') {
+            i++;
+            continue;
+        }else {
+            //第一个非空格字符计数+1
+            cnt++;
+            //跳过后续的非空格字符
+            while (s[i] != ' ' && i<len) {
+                i++;
+            }
+        }
+    }
+    //返回单词数量
+    return cnt;
+}

2023/homework/mingsenyang/leetcode852.c

@@ -0,0 +1,22 @@
+int peakIndexInMountainArray(int* arr, int arrSize) {
+    int mid;
+    int start = 0;
+    int end = arrSize-1;
+    while (true) {
+        // 二分法查找
+        mid = (start + end)/2;
+        if (arr[mid]>arr[mid-1] && arr[mid]>arr[mid+1]) {
+            return mid;
+        }
+        // 继续查找mid~end范围
+        if (arr[mid]>arr[mid-1] && arr[mid]<arr[mid+1]) {
+            start = mid;
+            continue;
+        }
+        // 继续查找start~mid范围
+        if (arr[mid]<arr[mid-1] && arr[mid]>arr[mid+1]) {
+            end = mid;
+            continue;
+        }
+    }
+}