update string ops

xiaoningning · xiaoningning · commit 1244ba904b52 · 2012-07-08T22:49:51.000-07:00
diff --git a/PuzzleCoding/src/SearchInRotatedSortedArray.java b/PuzzleCoding/src/SearchInRotatedSortedArray.java
@@ -51,7 +51,7 @@ public static int search(int a[], int left, int right, int x) {
         if (x == a[mid]) { // Found element
             return mid;
         }
-        if (right < left) {
+        if (right < left || right < 0 || left >= a.length || a.length == 0) {
             return -1;
         }
 
diff --git a/PuzzleCoding/src/StablePartition.java b/PuzzleCoding/src/StablePartition.java
@@ -10,7 +10,8 @@
 
 public class StablePartition {
     public static void main(String[] args){
-        int[] a = new int[]{1, -5, 2, 3, -4, -2, 9, 3, -1};
+        // int[] a = new int[]{1, -5, 2, 3, -4, -2, 9, 3, -1};
+        int[] a = new int[]{1, -5, 7, 3, -1, -2, 9, 3, -3};
         //int[] a = new int[]{1, -3, 2,-1,3};
 
         stable2WayPartition(a);
diff --git a/StringOps/src/StringOps.java b/StringOps/src/StringOps.java
@@ -19,7 +19,7 @@ public static void main(String[] args) {
         String lcs1 = LCS1(s1, s2);
         System.out.println("LCS1: " + lcs1);
 
-        String s3 = "abcdefg";
+        String s3 = "abcdefgh";
         System.out.println("s3: " + s3);
         int k = 3;
         String rs3 = rotateString(s3, k);
@@ -190,9 +190,14 @@ public static String reverse(String st, int s, int e) {
 
     public static String rotateString(String s, int k) {
         int n = s.length();
+        /*
         String rs1 = reverse(s, 0, n - 1);
-        String rs2 = reverse(rs1, 0, k);
-        String rs3 = reverse(rs2, k + 1, n - 1);
+        String rs2 = reverse(rs1, 0, n-k-1);
+        String rs3 = reverse(rs2, n-k, n - 1);
+        */
+        String rs1 = reverse(s, 0, k-1);
+        String rs2 = reverse(rs1, k, n-1);
+        String rs3 = reverse(rs2, 0, n - 1);
 
         return rs3;
 

Original file line number	Diff line number	Diff line change
`@@ -51,7 +51,7 @@ public static int search(int a[], int left, int right, int x) {`
`51`	`51`	`if (x == a[mid]) { // Found element`
`52`	`52`	`return mid;`
`53`	`53`	`}`
`54`		`- if (right < left) {`
	`54`	`+ if (right < left \|\| right < 0 \|\| left >= a.length \|\| a.length == 0) {`
`55`	`55`	`return -1;`
`56`	`56`	`}`
`57`	`57`