public:if(len<1)return 0;if(len==1)if(len==2)elseint ma=0;i<len;i++)elsema=pre2;pre1=pre2;pre2=ma;return ma;
2025-03-15 22:47:10
173
public:i<length;i++){elsereturn max;
2025-03-14 20:09:53
251
常规：public:i<=n;i++)p[i]=i;else递归public:else。
2025-03-12 21:07:39
211
public:i>0;i--)return i;return 0;
2025-03-12 16:54:01
112
public:while(s!=0)
2025-03-12 16:52:22
100
*** };*/public:root2||!else。
2025-03-10 20:58:19
486
*** };*/public:return 0;return 1;elseelse。
2025-03-09 19:57:15
185
*** };*/public:=null)
2025-03-08 20:47:26
380
*** };*/public:while(head!=Null)p=head;head=n;return p;
2025-03-08 20:35:44
143
*** };*/public:i<n;i++)=Null)
2025-03-06 22:07:56
156
*** };*/public:
2025-03-06 21:53:36
226
public:int j=0;i++;j++;elsei= i-j+1;j=0;return i-j;
2025-03-04 22:20:40
182
public:left++)if(s[left]!=s[right])right--;
2025-03-03 21:48:04
150
public:i<s.length;i++)i<t.length;i++)
2025-03-03 21:35:22
150
public:i<s.length;i++)i<s.length;i++)return i;
2025-03-03 20:55:46
221
public:char p;i<length;i++)p=a[i];
2025-03-03 20:35:37
117
public:int i=0;while(x!=0)x/=10;return i;
2025-03-01 20:23:14
111
public:i<length/2;i++)s[i]=temp;
2025-03-01 20:07:03
148
public:int m=0;n++)if(nums[n]!=0)
2025-03-01 19:52:31
473
public:i>=0;i--)=0)
2025-02-27 21:25:03
119
public:int i=0;right++;elseleft++;
2025-02-27 21:11:37
153
public:int n=0;i++)n^=nums[i];return n;
2025-02-27 20:57:36
136
public:i<k;i++)
2025-02-27 20:52:12
119
public:int m;i>0;i--)m=nums[i];nums[n]=m;
2025-02-27 20:38:58
140
leetcode买卖股票。
2025-02-27 20:37:49
116
leetcode数组。
2025-02-27 20:36:45
123
RSS订阅