摘要：
int minimumOperations(char* leaves) { int n = strlen(leaves); int f[n][3]; f[0][0] = (leaves[0] == 'y'); f[0][1] = f[0][2] = f[1][2] = INT_MAX; for (i 阅读全文
posted @ 2020-12-05 22:44
温暖了寂寞
阅读(74)
评论(0)
推荐(0)
摘要：
int lengthOfLongestSubstring(char * s){ int i, j = 0, count = 0, max = 0, index[128] = { 0 }, start = 0; for (i = 0; s[i] != '\0'; i++) { if (index[s[ 阅读全文
posted @ 2020-12-05 22:43
温暖了寂寞
阅读(53)
评论(0)
推荐(0)
浙公网安备 33010602011771号