u010912405的专栏

Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without usi

class Solution { public: void reverseWords(string &s) { string ss; int i = s.length()-1; while(i>=0) { while(i>=0&&s[i] == ' ') {

public class Solution { public int maxProduct(int[] A) { int n=A.length; if(n==0) return 0; if(n==1) return A[0]; int curMin=A[0]; int curMax=A[0];

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = "leetcode", dict = ["leet"