Fixed Point in Python

Suppose we have an array A of unique integers sorted in ascending order, we have to return the smallest index i that satisfies A[i] == i. Return -1 if no such i exists. So if the array is like [-10,-5,0,3,7], then the output will be 3, as A[3] = 3 the output will be 3.

To solve this, we will follow these steps −

• For i in range 0 to length of A
  • if i = A[i], then return i
• return -1

Example(Python)

Let us see the following implementation to get a better understanding −

 Live Demo

class Solution(object):
   def fixedPoint(self, A):
      for i in range(len(A)):
         if i == A[i]:
            return i
      return -1
ob1 = Solution()
print(ob1.fixedPoint([-10,-5,0,3,7]))

Input

[-10,-5,0,3,7]

Output

3

Arnab Chakraborty

Published on 27-Feb-2020 06:54:47

• Related Questions & Answers
• Decimal fixed point and floating point arithmetic in Python
• Fixed Point and Floating Point Number Representations
• What is Fixed Point Representation in Computer Architecture?
• C# Fixed-Point (“F”) Format Specifier
• Find a Fixed Point in an array with duplicates allowed in C++
• Find a Fixed Point (Value equal to index) in a given array in C++
• Find a Fixed Point (Value equal to index) in a given array in C++ Program
• Difference between Point-to-Point and Multi-point Communication
• Point-to-Point Protocol (PPP)
• Fixed Positioning in CSS
• CSS position: fixed;
• Find bitonic point in given bitonic sequence in Python
• What is Point-to-Point Protocol (PPP)?
• Rotation of a point about another point in C++
• Fixed Positioning with CSS