Bernard Wong
  • Software Engineer
  • Problems
    • Lowest Common Ancestor of a Binary Tree
    • Longest Substring Without Repeating Characters
    • Longest Palindromic Substring
    • Longest Common Prefix
    • Isomorphic Strings
    • Integer to Roman
    • Frog Jump
    • Find the Difference
    • Find k closest elements to a given value
    • Longest Common Subsequence
    • Binary Search Tree from Sorted Array
    • Balanced Binary Tree
    • Sort Using Two Stacks
    • O(1) Stack
    • k-th element to last of a LinkedList
    • Dedup LinkedList
    • Check Rotated String
    • Compress String by Character Count
    • Escape HTML whitespace
    • Check String Permutation
    • Unique String
    • Container With Most Water
    • 4 Sum
    • 3 Sum Closest
    • 3 Sum
    • 2 Sum
    • Maximum Subarray
    • Nested List Weight Sum
    • Palindrome Number
    • Pow(x, n)
    • Regular Expression Matching
    • Remove Nth Node From End of List
    • Reverse Integer
    • Roman to Integer
    • Rotate Array
    • Search a 2D Matrix
    • Shortest Word Distance
    • Two Sum III - Data structure design
    • Valid Parentheses
    • ZigZag Conversion
    • Quicksort
    • Add Two Numbers
    • Best Time to Buy and Sell Stock
    • Letter Combinations of a Phone Number
  • Data Structures
    • Heap
Powered by GitBook
On this page
  1. Problems

ZigZag Conversion

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)

P A H N A P L S I I G Y I R

And then read line by line: "PAHNAPLSIIGYIR"
<br>
<br>Write the code that will take a string and make this conversion given a number of rows:

> convert("PAYPALISHIRING", 3) 

should return 

> "PAHNAPLSIIGYIR"
def convert(s: String, numRows: Int): String = {
  numRows match {
    case 1 => s
    case n if n > 1 => {
      val lengthPerCycle = 2 * numRows - 2
      val cycles = (s.length / lengthPerCycle) + 1
      val sb = new StringBuilder
      for (i <- 0 until numRows) {
        for (cycle <- 0 until cycles) {
          // print full vertical
          val col = (cycle * lengthPerCycle) + i
          if (col < s.length)
            sb.append(s(col))
          // print diagonal
          val dia = ((cycle + 1) * lengthPerCycle) - i
          if (i != 0 && i < numRows - 1 && dia < s.length)
            sb.append(s(dia))
        }
      }
      sb.toString()
    }
    case _ => throw new Error("negative number")
  }
}

convert("PAYPALISHIRING", 3)

PreviousValid ParenthesesNextQuicksort

Last updated 6 years ago