weixin_44264668的博客

https://leetcode-cn.com/problems/roman-to-integer/ #include<stdio.h> #include<string.h> int romanToInt(char * s){ int num = 0; int tem = 0; int cmp = 0; for(int i = 0;*(s+i)!='\0';i++){ cmp = tem; switch(s[i]){

https://leetcode-cn.com/problems/palindrome-number/ #include<stdio.h> #include<stdbool.h> bool isPalindrome(int x){ int len = 1; int xx= x; int num1 = 1; int num2 = 1; if(x < 0){ return false; } while(xx

删除排序数组中的重复项 #include<stdio.h> int len_g; int set(int *arr){ int len=0; for(int i = 0;i<len_g;i++){ for(int j = i+1;j<len_g;j++){ if(arr[i]<arr[j]){ arr[i+1] = arr[j]; break;