LintCode 1283 · Reverse String.java

	// Approach #1 - Converging Two Pointers - O(n) T O(n) S
	public class Solution {
	/**
	* @param s: a string
	* @return: return a string
	*/
	public String reverseString(String s) {
	// handle corner cases
	if (s == null || s.length() < 2) {
	return s;
	}
	int i = 0, j = s.length() - 1;
	char[] reversing = s.toCharArray();
	while(i < j) {
	char tmp = reversing[i];
	reversing[i] = reversing[j];
	reversing[j] = tmp;
	i++;
	j--;
	}
	return new String(reversing);
	}
	}

view raw LintCode 1283 · Reverse String.java hosted with ❤ by GitHub