leetcode笔记 53. Maximum Subarray & 58. Length of Last Word

leetcode刷题10天
53. Maximum Subarray
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
代码：

class Solution {
    public int maxSubArray(int[] nums) {
    	if(nums.length<=0)
    		return 0;
    	int[] temp = new int[nums.length];
    	temp[0] = nums[0];
    	int maxNum = nums[0];
    	for(int i = 1;i<nums.length;i++) {
    		temp[i] = Math.max(temp[i-1]+nums[i], nums[i]);
    		maxNum = Math.max(temp[i],maxNum);
    	}
    	return maxNum;     
    }
}

58. Length of Last Word
    Given a string s consists of upper/lower-case alphabets and empty space characters ’ ', return the length of last word in the string.

If the last word does not exist, return 0.

Note: A word is defined as a character sequence consists of non-space characters only.

Example:

Input: “Hello World”
Output: 5

代码：

class Solution {
    public int lengthOfLastWord(String s) {
        if (s.length()<=0 ) 
        	return 0;
        int pos1 = s.length() - 1;
        for(;pos1>=0;pos1--) {
        	if(s.charAt(pos1)!=' ')
        		break;
        }
        int pos2 = pos1;

        for(;pos2>=0;pos2--) {
        	if(s.charAt(pos2) == ' ')
        		break;
        }
        if (pos1 < 0) 
        	return 0;
        return pos1-pos2;
    }
    
}